تقرير
Did Turing prove the undecidability of the halting problem?
العنوان: | Did Turing prove the undecidability of the halting problem? |
---|---|
المؤلفون: | Hamkins, Joel David, Nenu, Theodor |
سنة النشر: | 2024 |
المجموعة: | Computer Science Mathematics |
مصطلحات موضوعية: | Mathematics - Logic, Computer Science - Logic in Computer Science |
الوصف: | We discuss the accuracy of the attribution commonly given to Turing's 1936 paper "On computable numbers..." for the computable undecidability of the halting problem, coming eventually to a nuanced conclusion. Comment: 18 pages. Commentary may be made on the first author's blog at https://jdh.hamkins.org/turing-halting-problem |
نوع الوثيقة: | Working Paper |
URL الوصول: | http://arxiv.org/abs/2407.00680 |
رقم الأكسشن: | edsarx.2407.00680 |
قاعدة البيانات: | arXiv |
الوصف غير متاح. |