Super-recursive algorithm
In computability theory, super-recursive algorithms are a generalization of ordinary algorithms that are more powerful, that is, compute more than Turing machines. The term was introduced by Mark Burgin, whose book "Super-recursive algorithms" develops their theory and presents several mathematical models. Turing machines and other mathematical models of conventional algorithms allow researchers to find properties of recursive algorithms and their computations. In a similar way, mathematical models of super-recursive algorithms, such as , allow researchers to find properties of super-recursive algorithms and their computations.
- Comment
- enIn computability theory, super-recursive algorithms are a generalization of ordinary algorithms that are more powerful, that is, compute more than Turing machines. The term was introduced by Mark Burgin, whose book "Super-recursive algorithms" develops their theory and presents several mathematical models. Turing machines and other mathematical models of conventional algorithms allow researchers to find properties of recursive algorithms and their computations. In a similar way, mathematical models of super-recursive algorithms, such as , allow researchers to find properties of super-recursive algorithms and their computations.
- Has abstract
- enIn computability theory, super-recursive algorithms are a generalization of ordinary algorithms that are more powerful, that is, compute more than Turing machines. The term was introduced by Mark Burgin, whose book "Super-recursive algorithms" develops their theory and presents several mathematical models. Turing machines and other mathematical models of conventional algorithms allow researchers to find properties of recursive algorithms and their computations. In a similar way, mathematical models of super-recursive algorithms, such as , allow researchers to find properties of super-recursive algorithms and their computations. Burgin, as well as other researchers (including Selim Akl, Eugene Eberbach, Peter Kugel, Jan van Leeuwen, Hava Siegelmann, Peter Wegner, and Jiří Wiedermann) who studied different kinds of super-recursive algorithms and contributed to the theory of super-recursive algorithms, have argued that super-recursive algorithms can be used to disprove the Church-Turing thesis, but this point of view has been criticized within the mathematical community and is not widely accepted.
- Hypernym
- Generalization
- Is primary topic of
- Super-recursive algorithm
- Label
- enSuper-recursive algorithm
- Link from a Wikipage to an external page
- foldoc.org/%3Fanytime+algorithm
- arxiv.org/abs/0708.2686
- www.math.ucla.edu/~asl/bsl/1302/1302-004.ps
- comjnl.oxfordjournals.org/cgi/reprint/49/6/762-a.pdf
- www.computingreviews.net/browse/browse_topics4.cfm%3Fccs_id=2376
- wayback.archive-it.org/all/20080221162316/http:/people.cs.uchicago.edu/~simon/TEACH/28000/DavisUniversal.pdf
- web.mit.edu/~6.863/www/spring2009/readings/gold67limit.pdf
- philsci-archive.pitt.edu/archive/00003180/
- www.la-acm.org/Archives/laacm9912.html
- www.ams.org/mathscinet/search/publdoc.html%3Fpg1=IID&s1=193826&r=3&mx-pid=2246430
- siba-sinmdb.unile.it/cgi-bin/zmen/ZMATH/en/quick.html%3Ffirst=1&maxdocs=3&type=html&an=1070.68038&format=complete
- Link from a Wikipage to another Wikipage
- Academy of Sciences of the Czech Republic
- Algorithm
- Arithmetical hierarchy
- BioSystems
- Birkhäuser
- Brown University
- Bulletin of Symbolic Logic
- Category:Algorithms
- Category:Hypercomputation
- Category:Theory of computation
- Church-Turing thesis
- Church–Turing thesis
- Complexity and Real Computation
- Computability theory
- Computing Reviews
- European Association for Theoretical Computer Science
- FOLDOC
- Hava Siegelmann
- Hypercomputation
- Information and Control
- Interactive computation
- J. Symb. Log.
- Jan van Leeuwen
- Journal of Symbolic Logic
- Jürgen Schmidhuber
- Martin Davis (mathematician)
- MathSciNet
- Minds and Machines
- North-Holland Publishing Company
- Proc. Lond. Math. Soc.
- Quantum algorithms
- Selim Akl
- Springer Publishing
- Supertask
- The Computer Journal
- Theoretical Computer Science (journal)
- Theory of everything
- Turing machine
- Turing machines
- Universal Turing machine
- Zentralblatt MATH
- SameAs
- 4jF2b
- Algoritmo super-recursivo
- m.03nnd 4
- Q5295939
- Super-recursive algorithm
- الگوریتمهای مافوق بازگشتی
- Subject
- Category:Algorithms
- Category:Hypercomputation
- Category:Theory of computation
- WasDerivedFrom
- Super-recursive algorithm?oldid=1119788412&ns=0
- WikiPageLength
- 16256
- Wikipage page ID
- 15641067
- Wikipage revision ID
- 1119788412
- WikiPageUsesTemplate
- Template:Citation
- Template:Cn
- Template:Isbn
- Template:Short description