Re: Alan Turing's Halting Problem is incorrectly formed (PART-TWO)
From: Bryan Olson (bryanjugglercryptographer_at_yahoo.com)
Date: 06/26/04
- Next message: Butch Malahide: "Re: Zorn's lemma for families of subsets of a countable set"
- Previous message: Jeffrey Ketland: "Re: Exception to the rule? (Tarski´s T-scheme)"
- In reply to: Peter Olcott: "Re: Alan Turing's Halting Problem is incorrectly formed (PART-TWO)"
- Next in thread: Peter Olcott: "Re: Alan Turing's Halting Problem is incorrectly formed (PART-TWO)"
- Reply: Peter Olcott: "Re: Alan Turing's Halting Problem is incorrectly formed (PART-TWO)"
- Messages sorted by: [ date ] [ thread ]
Date: 25 Jun 2004 17:12:47 -0700
Peter Olcott wrote
[...]
> bool LoopIfYouSayItHalts (bool YouSayItHalts)
> {
> if (YouSayItHalts)
> while (true) ;
> else
> return false;
> }
>
> You are supposed to imagine the code that gets
> the user input, and calls the above function with
> true or false, which (do I really need to say this?)
> is your response to the question:
> Does this function halt?
The halting problem is to determine whether a given program
halts with a given input. Check the reference you gave.
What does your ability to make up an ill-defined problem have to
do with anything Alan Turing proved?
-- --Bryan
- Next message: Butch Malahide: "Re: Zorn's lemma for families of subsets of a countable set"
- Previous message: Jeffrey Ketland: "Re: Exception to the rule? (Tarski´s T-scheme)"
- In reply to: Peter Olcott: "Re: Alan Turing's Halting Problem is incorrectly formed (PART-TWO)"
- Next in thread: Peter Olcott: "Re: Alan Turing's Halting Problem is incorrectly formed (PART-TWO)"
- Reply: Peter Olcott: "Re: Alan Turing's Halting Problem is incorrectly formed (PART-TWO)"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|