Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Zeno_machine> ?p ?o. }
Showing items 1 to 30 of
30
with 100 items per page.
- Zeno_machine abstract "In mathematics and computer science, Zeno machines (abbreviated ZM, and also called Accelerated Turing machine, ATM) are a hypothetical computational model related to Turing machines that allows a countably infinite number of algorithmic steps to be performed in finite time. These machines are ruled out in most models of computation.More formally, a Zeno machine is a Turing machine that takes 2−n units of time to perform its n-th step; thus, the first step takes 0.5 units of time, the second takes 0.25, the third 0.125 and so on, so that after one unit of time, an infinite number of steps will have been performed.The idea of Zeno machines was first discussed by Hermann Weyl in 1927; they are named after the ancient Greek philosopher Zeno of Elea (see Zeno's paradoxes). Zeno machines play a crucial role in some theories. The theory of the Omega Point devised by physicist Frank J. Tipler, for instance, can only be valid if Zeno machines are possible.".
- Zeno_machine wikiPageID "1256751".
- Zeno_machine wikiPageRevisionID "547700827".
- Zeno_machine hasPhotoCollection Zeno_machine.
- Zeno_machine subject Category:Hypercomputation.
- Zeno_machine subject Category:Models_of_computation.
- Zeno_machine subject Category:Supertasks.
- Zeno_machine subject Category:Turing_machine.
- Zeno_machine type Assistant109815790.
- Zeno_machine type CausalAgent100007347.
- Zeno_machine type LivingThing100004258.
- Zeno_machine type Model110324560.
- Zeno_machine type ModelsOfComputation.
- Zeno_machine type Object100002684.
- Zeno_machine type Organism100004475.
- Zeno_machine type Person100007846.
- Zeno_machine type PhysicalEntity100001930.
- Zeno_machine type Whole100003553.
- Zeno_machine type Worker109632518.
- Zeno_machine type YagoLegalActor.
- Zeno_machine type YagoLegalActorGeo.
- Zeno_machine comment "In mathematics and computer science, Zeno machines (abbreviated ZM, and also called Accelerated Turing machine, ATM) are a hypothetical computational model related to Turing machines that allows a countably infinite number of algorithmic steps to be performed in finite time.".
- Zeno_machine label "Zeno machine".
- Zeno_machine label "Машина Зенона".
- Zeno_machine sameAs m.04mq5n.
- Zeno_machine sameAs Q2072061.
- Zeno_machine sameAs Q2072061.
- Zeno_machine sameAs Zeno_machine.
- Zeno_machine wasDerivedFrom Zeno_machine?oldid=547700827.
- Zeno_machine isPrimaryTopicOf Zeno_machine.