Re: The Psychology of Responding to Crackpots

From: Bryan Olson (fakeaddress_at_nowhere.org)
Date: 07/09/04 

Date: Fri, 09 Jul 2004 02:36:11 GMT

Peter Olcott wrote:
> "Bryan Olson" wrote:
>>Peter Olcott wrote:
[...]
>> > I was talking about
>> > the philosophy of language. Every mathematical argument that
>> > was presently did not apply to most everything that I said.
>>
>>Likewise, "most everything that [you] said" had nothing to do
>>with the mathematical argument Turing presented.
>
> In one sense what Turing stated was mathematically sound.
> There does exist a computer program that can thwart the
> universal set of WillHalt() functions.

That has nothing to do with the halting problem, nor the proof
halting is not Turing-decidable. 

-- 
--Bryan

Relevant Pages

  • Re: Yet another Attempt at Disproving the Halting Problem
    ... >analyzer that always returns a correct result back to the program being ... You haven't refuted Turing, you've changed the ... "solve the halting problem", you are free to do so. ... So your approach to producing a pink elephant is to build a dark ...
    (comp.theory)
  • Re: Yet another Attempt at Disproving the Halting Problem
    ... >analyzer that always returns a correct result back to the program being ... You haven't refuted Turing, you've changed the ... "solve the halting problem", you are free to do so. ... So your approach to producing a pink elephant is to build a dark ...
    (comp.lang.cpp)
  • Re: Yet another Attempt at Disproving the Halting Problem
    ... >analyzer that always returns a correct result back to the program being ... You haven't refuted Turing, you've changed the ... "solve the halting problem", you are free to do so. ... So your approach to producing a pink elephant is to build a dark ...
    (sci.logic)
  • Re: Church-Turing compared to Zuse-Fredkin thesis (two new papers)
    ... Turing discusses the operation of the Turing ... > "We will also suppose that the number of states of mind which need be ... a finite number of squares on the tape. ... The halting problem is also a red herring. ...
    (comp.theory)
  • Re: Disproof of the Halting Problems Conclusion
    ... > is specifically limited to Turing Machines. ... > states that the solution set of the Halting Problem is limited to Turing ... are equivalent in computing power. ...
    (sci.logic)
Loading