Diferenças entre edições de "Problema da parada"

2 bytes removidos ,  07h39min de 3 de janeiro de 2014
updating interwiki link
m (A migrar 25 interwikis, agora providenciados por Wikidata em d:q622849)
(updating interwiki link)
* {{cite book | authorlink = Michael Sipser | last = Sipser | first = Michael | year = 2006 | title = Introdução à Teoria da Computação | edition = Segunda edição | publisher = Cengage | id = ISBN 8522104999 | chapter = Seção 4.2: O problema da parada | pages = pp.182–192 }}
* [[Alan Turing]], ''On computable numbers, with an application to the Entscheidungsproblem'', Proceedings of the London Mathematical Society, Series 2, 42 (1936), pp 230–265. [http://www.turingarchive.org/browse.php/B/12 online version] This is the epochal paper where Turing defines [[Turing machine]]s, formulates the halting problem, and shows that it (as well as the [[Entscheidungsproblem]]) is unsolvable.
* [[Wikic2:HaltingProblem]]
* [[B. Jack Copeland]] ed. (2004), ''The Essential Turing: Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life plus The Secrets of Enigma,'' Clarendon Press (Oxford University Press), Oxford UK, ISBN 0-19-825079-7.
* {{cite book | authorlink = Martin Davis| last=Davis|first=Martin|title= The Undecidable, Basic Papers on Undecidable Propositions, Unsolvable Problems And Computable Functions| publisher= Raven Press| location= New York|year=1965}}. Turing's paper is #3 in this volume. Papers include those by Godel, Church, Rosser, Kleene, and Post.
1 304