[FOM] Re: Comment on Church's Thesis (Harvey Friedman)
Dennis E. Hamilton
dennis.hamilton at acm.org
Tue Jan 6 19:59:22 EST 2004
The undecidability of the halting problem is generally developed as a result about Turing machines.
Where do you see Church's Thesis entering into it?
-- orcmid operating on Compagno
Dennis E. Hamilton | on-line M.Sc in IT student | KIT eLearning
mailto:Dennis_Hamilton at embanet.com | gsm:+1-206.779.9430
mailto:Dennis.Hamilton at acm.org | http://orcmid.com
OpenPGP public key fingerprint BFE5 EFB8 CB51 8781 5274 C056 D80D 0C3F A393 27EC
From: fom-bounces at cs.nyu.edu [mailto:fom-bounces at cs.nyu.edu]On Behalf Of addamo
Sent: Monday, January 05, 2004 23:43
Subject: [FOM] Re: Comment on Church's Thesis (Harvey Friedman)
[ ... ]
Do you or anybody know a proof of the undecidability of the Halting problem
not depending on Church's Thesis?
More information about the FOM