Re: Refutation of the Halting Problem's Proof (Clarifications Wanted)

From: >parr\(*> (lauryking_at_N0SPAMbtinternet.moc)
Date: 08/25/04 

Date: Wed, 25 Aug 2004 21:59:59 +0000 (UTC)

"Peter Olcott" <olcott@worldnet.att.net> wrote in message
news:LT_Wc.245574$OB3.60982@bgtnsc05-news.ops.worldnet.att.net...
| www.halting-proiblem.com
| I want to make what I am saying as clear as possible. If anyone
| has any points that are still not clear, this is the thread to ask for
| clarifications.
|
| Also I would like to work towards a consensus of the best way
| to present the ideas that are mentioned on my website,
| [...]

Some while back, I ran a semantic/syntactic clean-up program on your page, see end
of this post. I'm sure everyone will agree that the sense has been improved
dramatically.

One thing still missing is the inclusion of the Quantum logic process. 

--
<º)&&PARR##sss==<(   Parr
--
============= start revised text ================
Confutazione of the d'arresto problem.
De Synopse Cracks:
Alan Turing d'une, that one is the proven direction to obstruct qu'il, is
impossible, to settle down a dell'arresto analyzer that a correct result always
still gives the shutdowns the other way around to machine of Turing, that is
analyzed.
Since then that to the machine of Turing still gives to shutdowns the other way
around or the resulting one, direction analyzed only of n'est of stabilization
dell'analizzatore, test relative n'a of dell'arresto that it indicated that she is
not that one, that the constructions an analyzer of the work of the apprehension in
that one he correctly stop each universal element of l'ensemble of the white spots
/negras something of Turing, is impossible.
Definition of the d'arresto problem.
Here n exist not a machine of Turing, that one that can determine correctly, if each
universal element in l'ensemble of the white spots /negras something of the finished
will s'exécutera Turing in certain number of d'étapes for specific of the data he of
d'entrée.
It types this test without ceremony.
L'intradosso for this test without ceremony in the middle must in agreement with use
the differences the first and point of the fast Synopse. Much which we must give to
form the end to decide the end to eliminate the historical prohibition, nell'ordine
that the problem of d'arresto of s'abstenir must emit shutdowns the other way
around, the extreme result l'analyse l'étude. L'one-way, to this s'abstenir that it
happens, to that it gives return to him for him are stopped simply of dell'arresto l
analysor of the return for n'importe, machine of l'altra of Turing.
Since then that l analysor of the box he to s'appeler of an apprehension of two
diverse contexts.
(1) like the part of the execution of d'une un'altra of Turing Machine's.
(2) independently certain a other execution of Turing Machine's.
These ways they slight them they returned them for are dell'arresto you l'analyse
for each universal element of l'ensemble of the white spots /negras something of
Turing to obtain always later.
If l analysor dell'arresto that is to say, indicated like the part of the execution
of d'une un'altra of Turing Machine's, he if to arrest it is simply determined. If l
analysor dell'arresto qu'il n'a that does not determine indicated like the part of
the execution of d'une un'altra of Turing Machine's, to follow analyzes the thematic
description of the machine of Turing and writes THAT to a specific place of the
volume of s'il it is arrested, if the ZERO to this are not written exactly places.
The phase of L'ultima is the method, of that dell'arresto l analysor that can
determine the relative context d invocation. That one can be a device the very
simple ones, that one that is used in the machine for all the applications of
Turing. Dell'arresto L analysor would request l'UTM simply, if the relative to that
he obstructs specifically indicated that the circumstance has n'importe, of that
d'état defined transistion. It is the very simple ones for l'UTM, this one the
information, to make him the attempts simply available l'action, that l'état he is
this in the relative table of the table of transistion d'état. S'il n'y does not
have each transistion possible d'état, that one that is defined of the dell'arresto
states that obstruct analyzer's, then l analysor of the apprehension of latta one is
broken external with the emergency n'a of qu'il knows indicated like the part of the
execution of d'une un'altra of Turing Machine's. Of s'il without the return of the
danger the information can use this, to the box the end to determine a result
around, or this qu'il must give the shutdowns the other way around to s'abstenir, a
result.
If this mass is made examinación, then the machine of Turing of the Gegenbeispiels,
that had been used here,
lower surfaces for the Contructing the test of d'arresto of the marks of the problem
plus the end to have affinchè n'importe, the effect of l analysor dell'arresto or
the relative capacity provides returns she corrects for each universal element of
l'ensemble of the white spots /negras something of Turing.
============= end revised text ================

Relevant Pages

  • Re: Refutation of the Halting Problems Proof (Clarifications Wanted)
    ... to settle down a dell'arresto analyzer that a correct result always ... > still gives the shutdowns the other way around to machine of Turing, ... > analysor of the return for n'importe, ... > like the part of the execution of d'une un'altra of Turing Machine's. ...
    (comp.theory)
  • Re: Refutation of the Halting Problems Proof (Clarifications Wanted)
    ... Alan Turing d'une, that one is the proven direction to obstruct qu'il, is ... to settle down a dell'arresto analyzer that a correct result always ... Since then that l analysor of the box he to s'appeler of an apprehension of two ... like the part of the execution of d'une un'altra of Turing Machine's. ...
    (sci.logic)
  • Re: Refutation of the Halting Problems Proof (Clarifications Wanted)
    ... to settle down a dell'arresto analyzer that a correct result always ... > still gives the shutdowns the other way around to machine of Turing, ... > analysor of the return for n'importe, ... > like the part of the execution of d'une un'altra of Turing Machine's. ...
    (sci.logic)
  • 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)