Basis for bypassing the Halting Problem ?
 From: Peter Olcott <NoSpam@xxxxxxxxxxxxxx>
 Date: Sun, 05 Feb 2012 08:15:40 0600
The Turing Machine has three behaviors
(1) Transition to a unique final state indicating that the target of its analysis will halt.
(2) Transition to a unique final state indicating that the target of its analysis will not halt.
(3) Transition to a unique final state indicating that one or more of the above two states has been modified in an attempt to produce the Halting Problem. This state may be dynamically generated such that it does not exist in its "Halting Problem" input. This state is to be taken as an alternative "will halt" state.
.
 FollowUps:
 Re: Basis for bypassing the Halting Problem ?
 From: Joshua Cranmer
 Re: Basis for bypassing the Halting Problem ?
 From: Patricia Shanahan
 Re: Basis for bypassing the Halting Problem ?
 Prev by Date: Re: test post
 Next by Date: Re: Basis for bypassing the Halting Problem ?
 Previous by thread: test post
 Next by thread: Re: Basis for bypassing the Halting Problem ?
 Index(es):
Relevant Pages
