Re: Refutation of the DisProof of the Halting Problem
From: Bryan Olson (bryanjugglercryptographer_at_yahoo.com)
Date: 07/27/04
- Next message: Kenneth Doyle: "Re: On The Proper Formulation Of The Halting Problem"
- Previous message: Talks With Beagles: "Re: Ethical Relativism (Cultural Differences Argument)"
- In reply to: Peter Olcott: "Re: Refutation of the DisProof of the Halting Problem"
- Next in thread: Peter Olcott: "Re: Refutation of the DisProof of the Halting Problem"
- Reply: Peter Olcott: "Re: Refutation of the DisProof of the Halting Problem"
- Reply: Andrew Koenig: "Re: Refutation of the DisProof of the Halting Problem"
- Messages sorted by: [ date ] [ thread ]
Date: 26 Jul 2004 18:23:18 -0700
Peter Olcott wrote:
> It is a very surprising turn of events. There was one message
> That I read this morning that got me thinking. After I thought
> about it I realized that my solution would not apply to Turing
> Machines. Not that my solution required something more than
> a Turing Machine, but something less.
That much is right. A model of computation *less* powerful than
Turing's may admit a program that decides the model's halting
problem. Halting is undecidable in any programming language that
is 'complete' in the sense of the Church-Turing thesis.
-- --Bryan
- Next message: Kenneth Doyle: "Re: On The Proper Formulation Of The Halting Problem"
- Previous message: Talks With Beagles: "Re: Ethical Relativism (Cultural Differences Argument)"
- In reply to: Peter Olcott: "Re: Refutation of the DisProof of the Halting Problem"
- Next in thread: Peter Olcott: "Re: Refutation of the DisProof of the Halting Problem"
- Reply: Peter Olcott: "Re: Refutation of the DisProof of the Halting Problem"
- Reply: Andrew Koenig: "Re: Refutation of the DisProof of the Halting Problem"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|
