مسئله توقف: تفاوت میان نسخهها
محتوای حذفشده محتوای افزودهشده
توضیحات مربوط به اثبات تناقض ناقص بود که توضیحات مربوطه تکمیل شد برچسبها: ویرایشهای مشکوک به خرابکاری ویرایشگر دیداری |
جز ربات: جایگزینی پیوند جادویی شابک با الگو شابک |
||
خط ۹۰:
{{چپچین}}
* Alan Turing, On computable numbers, with an application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, Series 2, 42 (1936), pp 230–265. online version This is the epochal paper where Turing defines Turing machines, formulates the halting problem, and shows that it (as well as the Entscheidungsproblem) is unsolvable.
* Sipser, Michael (2006). "Section 4.2: The Halting Problem", Introduction to the Theory of Computation, Second Edition, PWS Publishing, pp. 173–182. {{ISBN
* Wiki: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
* Martin Davis, The Undecidable, Basic Papers on Undecidable Propositions, Unsolvable Problems And Computable Functions, Raven Press, New York, 1965. Turing's paper is #3 in this volume. Papers include those by Godel, Church, Rosser, Kleene, and Post.
* Martin Davis, Computability and Unsolvability, McGraw-Hill, New York, 1958.
| |||