Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Zeno_machine> ?p ?o }
Showing triples 1 to 58 of
58
with 100 triples 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, a countably infinite (i.e. ℵ0) number of steps will have been performed.The idea of Zeno machines was first discussed by Hermann Weyl in 1927; the name refers to Zeno's paradoxes, attributed to the ancient Greek philosopher Zeno of Elea. 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 wikiPageLength "2558".
- Zeno_machine wikiPageOutDegree "25".
- Zeno_machine wikiPageRevisionID "647268557".
- Zeno_machine wikiPageWikiLink Aleph_0.
- Zeno_machine wikiPageWikiLink Aleph_number.
- Zeno_machine wikiPageWikiLink Category:Hypercomputation.
- Zeno_machine wikiPageWikiLink Category:Models_of_computation.
- Zeno_machine wikiPageWikiLink Category:Supertasks.
- Zeno_machine wikiPageWikiLink Category:Turing_machine.
- Zeno_machine wikiPageWikiLink Computer_science.
- Zeno_machine wikiPageWikiLink Countable_set.
- Zeno_machine wikiPageWikiLink Countably_infinite.
- Zeno_machine wikiPageWikiLink Frank_J._Tipler.
- Zeno_machine wikiPageWikiLink Halting_problem.
- Zeno_machine wikiPageWikiLink Hermann_Weyl.
- Zeno_machine wikiPageWikiLink Hypercomputation.
- Zeno_machine wikiPageWikiLink Mathematics.
- Zeno_machine wikiPageWikiLink Omega_Point.
- Zeno_machine wikiPageWikiLink Pseudocode.
- Zeno_machine wikiPageWikiLink Ross–Littlewood_paradox.
- Zeno_machine wikiPageWikiLink Supertask.
- Zeno_machine wikiPageWikiLink Thomsons_lamp.
- Zeno_machine wikiPageWikiLink Turing_machine.
- Zeno_machine wikiPageWikiLink Turing_machines.
- Zeno_machine wikiPageWikiLink Zeno_of_Elea.
- Zeno_machine wikiPageWikiLink Zenos_paradoxes.
- Zeno_machine wikiPageWikiLinkText "Zeno machine".
- Zeno_machine hasPhotoCollection Zeno_machine.
- Zeno_machine wikiPageUsesTemplate Template:Cite_journal.
- Zeno_machine wikiPageUsesTemplate Template:Nofootnotes.
- 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 hypernym Model.
- Zeno_machine type Article.
- Zeno_machine type Model.
- Zeno_machine type Person.
- Zeno_machine type Article.
- Zeno_machine type Concept.
- Zeno_machine type Machine.
- Zeno_machine type Method.
- Zeno_machine type Model.
- 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 sameAs Zenomaschine.
- Zeno_machine sameAs ماشین_زنو.
- Zeno_machine sameAs Zenonov_stroj.
- Zeno_machine sameAs m.04mq5n.
- Zeno_machine sameAs Машина_Зенона.
- Zeno_machine sameAs Зенонова_машина.
- Zeno_machine sameAs Машина_Зенона.
- Zeno_machine sameAs Q2072061.
- Zeno_machine sameAs Q2072061.
- Zeno_machine wasDerivedFrom Zeno_machine?oldid=647268557.
- Zeno_machine isPrimaryTopicOf Zeno_machine.