supertask

supertask
A quantifiably infinite number of operations that occur sequentially within a finite interval of time.
See Also: hypertask

Wikipedia foundation.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • Supertask — In philosophy, a supertask is a task occurring within a finite interval of time involving infinitely many steps (subtasks). A hypertask is a supertask with an uncountable number of subtasks. The term supertask was coined by the philosopher James… …   Wikipedia

  • supertask — /sooh peuhr task , tahsk /, n. Logic. a paradox resulting from the notion that a task requiring an infinite number of steps could be performed in a finite time by halving the duration of each step. [1970 75; SUPER + TASK] * * * …   Universalium

  • supertask — /sooh peuhr task , tahsk /, n. Logic. a paradox resulting from the notion that a task requiring an infinite number of steps could be performed in a finite time by halving the duration of each step. [1970 75; SUPER + TASK] …   Useful english dictionary

  • Thomson's lamp — is a puzzle that is a variation on Zeno s paradoxes. It was devised by philosopher James F. Thomson, who also coined the term supertask .Consider a lamp with a toggle switch. Flicking the switch once turns the lamp on. Another flick will turn the …   Wikipedia

  • Hilbert's paradox of the Grand Hotel — is a mathematical paradox about infinite sets presented by German mathematician David Hilbert (1862–1943). The Paradox of the Grand Hotel Consider a hypothetical hotel with infinitely many rooms, all of which are occupied that is to say every… …   Wikipedia

  • Hypercomputation — refers to various hypothetical methods for the computation of non Turing computable functions (see also supertask). The term was first introduced in 1999 by Jack Copeland and Diane Proudfoot [Copeland and Proudfoot,… …   Wikipedia

  • Zeno machine — In mathematics and computer science, Zeno machines (abbreviated ZM, and also called Accelerated Turing machine, ACM) are a hypothetical computational model related to Turing machines that allows a countably infinite number of algorithmic steps to …   Wikipedia

  • Paradoxes of set theory — This article contains a discussion of paradoxes of set theory. As with most mathematical paradoxes, they generally reveal surprising and counter intuitive mathematical results, rather than actual logical contradictions within modern axiomatic set …   Wikipedia

  • Ross–Littlewood paradox — A graph that shows the number of balls in and out of the vase for the first ten iterations of the problem. The Ross–Littlewood paradox (also known as the balls and vase problem or the ping pong ball problem) is a hypothetical problem in abstract… …   Wikipedia

  • Model theory — This article is about the mathematical discipline. For the informal notion in other parts of mathematics and science, see Mathematical model. In mathematics, model theory is the study of (classes of) mathematical structures (e.g. groups, fields,… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”