| http://dbpedia.org/ontology/abstract
|
Em teoria da computação, algoritmos super- … Em teoria da computação, algoritmos super-recursivos são uma generalização de algoritmos ordinários que são mais poderosos, isto é, computam mais que uma máquina de Turing. O termo foi introduzido por Mark Burgin, cujo livro Super-recursive algorithms desenvolve sua teoria e apresenta modelos matemáticos. Máquinas de Turing e outros modelos matemáticos de algoritmos convencionais permitem aos pesquisadores achar propriedades de algoritmos recursivos e de suas computações. De uma maneira similar, modelos matemáticos de algoritmos super-recursivos, como máquinas de Turing indutivas, permitem aos pesquisadores achar propriedades dos algoritmos super-recursivos e de suas computações. Mark Burgin, assim como outros pesquisadores (incluindo Selim Akl, Eugene Eberbach, Peter Kugel, Jan van Leeuwen, Hava Siegelmann, Peter Wegner, and Jiří Wiedermann) que estudaram diferentes tipos de algoritmos super-recursivos e contribuíram para a teoria dos algoritmos super-recursivos, têm argumentado que algoritmos super-recursivos podem ser usados para refutar a Tese de Church-Turing, mas esse ponto de vista foi muito criticado pela comunidade matemática e não foi amplamente aceito.de matemática e não foi amplamente aceito.
, In computability theory, super-recursive a … 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. 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.ical community and is not widely accepted.
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
http://foldoc.org/%3Fanytime%2Balgorithm +
, http://web.mit.edu/~6.863/www/spring2009/readings/gold67limit.pdf +
, http://siba-sinmdb.unile.it/cgi-bin/zmen/ZMATH/en/quick.html%3Ffirst=1&maxdocs=3&type=html&an=1070.68038&format=complete +
, https://www.math.ucla.edu/~asl/bsl/1302/1302-004.ps +
, https://wayback.archive-it.org/all/20080221162316/http:/people.cs.uchicago.edu/~simon/TEACH/28000/DavisUniversal.pdf +
, https://arxiv.org/abs/0708.2686 +
, http://www.computingreviews.net/browse/browse_topics4.cfm%3Fccs_id=2376 +
, http://comjnl.oxfordjournals.org/cgi/reprint/49/6/762-a.pdf +
, http://www.ams.org/mathscinet/search/publdoc.html%3Fpg1=IID&s1=193826&r=3&mx-pid=2246430 +
, http://philsci-archive.pitt.edu/archive/00003180/ +
, http://www.la-acm.org/Archives/laacm9912.html +
|
| http://dbpedia.org/ontology/wikiPageID
|
15641067
|
| http://dbpedia.org/ontology/wikiPageLength
|
16256
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1119788412
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Springer_Publishing +
, http://dbpedia.org/resource/Zentralblatt_MATH +
, http://dbpedia.org/resource/Computability_theory +
, http://dbpedia.org/resource/Proc._Lond._Math._Soc. +
, http://dbpedia.org/resource/Brown_University +
, http://dbpedia.org/resource/Information_and_Control +
, http://dbpedia.org/resource/Complexity_and_Real_Computation +
, http://dbpedia.org/resource/Quantum_algorithms +
, http://dbpedia.org/resource/Selim_Akl +
, http://dbpedia.org/resource/Hava_Siegelmann +
, http://dbpedia.org/resource/North-Holland_Publishing_Company +
, http://dbpedia.org/resource/Category:Hypercomputation +
, http://dbpedia.org/resource/Turing_machines +
, http://dbpedia.org/resource/FOLDOC +
, http://dbpedia.org/resource/Bulletin_of_Symbolic_Logic +
, http://dbpedia.org/resource/Journal_of_Symbolic_Logic +
, http://dbpedia.org/resource/J%C3%BCrgen_Schmidhuber +
, http://dbpedia.org/resource/Supertask +
, http://dbpedia.org/resource/Theoretical_Computer_Science_%28journal%29 +
, http://dbpedia.org/resource/MathSciNet +
, http://dbpedia.org/resource/Martin_Davis_%28mathematician%29 +
, http://dbpedia.org/resource/Church%E2%80%93Turing_thesis +
, http://dbpedia.org/resource/Jan_van_Leeuwen +
, http://dbpedia.org/resource/Theory_of_everything +
, http://dbpedia.org/resource/Category:Algorithms +
, http://dbpedia.org/resource/BioSystems +
, http://dbpedia.org/resource/Arithmetical_hierarchy +
, http://dbpedia.org/resource/J._Symb._Log. +
, http://dbpedia.org/resource/Category:Theory_of_computation +
, http://dbpedia.org/resource/Universal_Turing_machine +
, http://dbpedia.org/resource/Birkh%C3%A4user +
, http://dbpedia.org/resource/European_Association_for_Theoretical_Computer_Science +
, http://dbpedia.org/resource/Hypercomputation +
, http://dbpedia.org/resource/Computing_Reviews +
, http://dbpedia.org/resource/Academy_of_Sciences_of_the_Czech_Republic +
, http://dbpedia.org/resource/Minds_and_Machines +
, http://dbpedia.org/resource/Church-Turing_thesis +
, http://dbpedia.org/resource/Interactive_computation +
, http://dbpedia.org/resource/Algorithm +
, http://dbpedia.org/resource/The_Computer_Journal +
, http://dbpedia.org/resource/Turing_machine +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Cn +
, http://dbpedia.org/resource/Template:Short_description +
, http://dbpedia.org/resource/Template:Citation +
, http://dbpedia.org/resource/Template:Isbn +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Theory_of_computation +
, http://dbpedia.org/resource/Category:Hypercomputation +
, http://dbpedia.org/resource/Category:Algorithms +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Generalization +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Super-recursive_algorithm?oldid=1119788412&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Super-recursive_algorithm +
|
| owl:sameAs |
http://fa.dbpedia.org/resource/%D8%A7%D9%84%DA%AF%D9%88%D8%B1%DB%8C%D8%AA%D9%85%E2%80%8C%D9%87%D8%A7%DB%8C_%D9%85%D8%A7%D9%81%D9%88%D9%82_%D8%A8%D8%A7%D8%B2%DA%AF%D8%B4%D8%AA%DB%8C +
, http://dbpedia.org/resource/Super-recursive_algorithm +
, http://pt.dbpedia.org/resource/Algoritmo_super-recursivo +
, http://yago-knowledge.org/resource/Super-recursive_algorithm +
, https://global.dbpedia.org/id/4jF2b +
, http://www.wikidata.org/entity/Q5295939 +
, http://rdf.freebase.com/ns/m.03nnd_4 +
|
| rdf:type |
http://dbpedia.org/class/yago/PsychologicalFeature100023100 +
, http://dbpedia.org/class/yago/Rule105846932 +
, http://dbpedia.org/class/yago/WikicatAlgorithms +
, http://dbpedia.org/class/yago/Algorithm105847438 +
, http://dbpedia.org/class/yago/Event100029378 +
, http://dbpedia.org/class/yago/YagoPermanentlyLocatedEntity +
, http://dbpedia.org/class/yago/Procedure101023820 +
, http://dbpedia.org/class/yago/Activity100407535 +
, http://dbpedia.org/class/yago/Abstraction100002137 +
, http://dbpedia.org/class/yago/Act100030358 +
|
| rdfs:comment |
In computability theory, super-recursive a … 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.cursive algorithms and their computations.
, Em teoria da computação, algoritmos super- … Em teoria da computação, algoritmos super-recursivos são uma generalização de algoritmos ordinários que são mais poderosos, isto é, computam mais que uma máquina de Turing. O termo foi introduzido por Mark Burgin, cujo livro Super-recursive algorithms desenvolve sua teoria e apresenta modelos matemáticos. Máquinas de Turing e outros modelos matemáticos de algoritmos convencionais permitem aos pesquisadores achar propriedades de algoritmos recursivos e de suas computações. De uma maneira similar, modelos matemáticos de algoritmos super-recursivos, como máquinas de Turing indutivas, permitem aos pesquisadores achar propriedades dos algoritmos super-recursivos e de suas computações.os super-recursivos e de suas computações.
|
| rdfs:label |
Algoritmo super-recursivo
, Super-recursive algorithm
|
