Re: Can a regular Turing Machine provide Protected Memory?

From: Owen Jacobson (angstrom_at_lionsanctuary.net)
Date: 08/31/04 

Date: Tue, 31 Aug 2004 07:46:53 GMT

On Tue, 31 Aug 2004 06:22:43 +0000, Keith Frayne wrote:

> "Peter Olcott" <olcott@worldnet.att.net> wrote:
>
> 'the Halting Problem'? I see another thread of yours, subject:
> "Refutation of the Halting Problem's Proof (Clarifications Wanted)" The
> link doesn't work so I haven't been able to work out what that one is all
> about, either.

The link in that thread is incorrect and should read
<http://www.halting-problem.com/>, which belongs to one Peter Olcott.

> Are we talking about something like
> http://en.wikipedia.org/wiki/Halting_problem? <start quote>
> The halting problem is a decision problem which can be informally stated
> as follows:
>
> Given a description of an algorithm and its initial input, determine
> whether the algorithm, when executed on this input, ever halts (the
> alternative is that it runs forever without halting).

We are, in fact, discussing that problem.

> Anyway. I gather that newstome has has refuted the Halting Problem?
> Where's his proof? Is there some error in Turing's 1936 proof?

Actually, that's somewhat backwards. For the past month or so, Peter
Olcott has been trumpeting that he's found a flaw in Turing's proof. The
nature of that "flaw" changes regularly, so it's not always easy
to determine what, exactly, Olcott means. Newstome is the latest person
to step up and comprehensively debate Peter's methods; the rest of us are
content to pick out the large features without filling in the details.

Peter's current line of attack relies on implementing "protected memory"
on a Turing machine, and on Turing machines detecting the context in which
they run. 

-- 
Some say the Wired doesn't have political borders like the real world,
but there are far too many nonsense-spouting anarchists or idiots who
think that pranks are a revolution.

Relevant Pages

  • Re: What is the Result from Invoking this Halt Function?
    ... Olcott that seems to compel a response? ... outrage or, at least, moral duty -- as when a liar or doctrinaire hack ... There is an elementary proof that the Halting Problem is unsolvable (one ...
    (comp.theory)
  • Re: What is the Result from Invoking this Halt Function?
    ... Olcott that seems to compel a response? ... outrage or, at least, moral duty -- as when a liar or doctrinaire hack ... There is an elementary proof that the Halting Problem is unsolvable (one ...
    (sci.logic)
  • Re: Can a regular Turing Machine provide Protected Memory?
    ... > The halting problem is a decision problem which can be informally stated ... > Given a description of an algorithm and its initial input, ... Olcott has been trumpeting that he's found a flaw in Turing's proof. ... on a Turing machine, and on Turing machines detecting the context in which ...
    (sci.logic)
  • Re: Solution to the halting Problem?
    ... > information on to another algorithm. ... >> the Halting Problem that can not be implemented as a Turing Machine ... The algorithms that test the return value of the Halt analyzer ...
    (comp.lang.cpp)
  • RE: New Binary Bruteforcing Method Discovered
    ... The Halting Problem isn't an unsolved conjecture, ... no machine less powerful than a UTM can solve it. ... but I've never seen a QC algorithm that gets around Turing's proof. ... If the human mind is a Turing Machine, ...
    (Vuln-Dev)
Loading