top | item 20698036 (no title) klawed | 6 years ago Don't forget Gödel! discuss order hn newest carlehewitt|6 years ago In his famous 1936 article, Turing correctly noted that proof of the computational undecidabilty of halting problem does not involve the same fixed point as the one used by Gödel.See the following: https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3418003 klawed|6 years ago Wow. Thanks for sharing this.
carlehewitt|6 years ago In his famous 1936 article, Turing correctly noted that proof of the computational undecidabilty of halting problem does not involve the same fixed point as the one used by Gödel.See the following: https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3418003 klawed|6 years ago Wow. Thanks for sharing this.
carlehewitt|6 years ago
See the following: https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3418003
klawed|6 years ago