Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > sci.logic > #172316

Re: Necessary sequence of halt decider's inference chain

Newsgroups sci.logic
Date 2018-02-09 22:20 -0800
References <GbednTUZccrxIuDHnZ2dnUU7-b_NnZ2d@giganews.com>
Message-ID <959bc654-e795-41a3-827f-fb0378bf7beb@googlegroups.com> (permalink)
Subject Re: Necessary sequence of halt decider's inference chain
From grahamcooper7@gmail.com

Show all headers | View raw


On Saturday, February 10, 2018 at 1:34:11 AM UTC+10, Pete Olcott wrote:
> http://www.liarparadox.org/H_evaluates_S.pdf
>         
> 
>       
>     This
>         is the text from the PDF. It is much more easily understood
> 
>     when
>         the state transition diagrams can be seen. 
> 
>         
> 
>         Understanding 
>     this
>         is a necessary prerequisite to understanding 
> 
>         how H Ĥx Ĥx would
>               be evaluated. Ĥx is constructed using H as its basis. 
>     
> 
>     
> 
>     Definition
>               of Turing Machine Ĥx 
>     
> 
>     q0
>             Wm ⊢* Ĥx qx Wm Wm ⊢* Ĥx qy 
>     
> 
>     q0
>             Wm ⊢* Ĥx qx Wm Wm ⊢* Ĥx qn
> 
>     
> 
>     The
>         squiggly lines proceeding from state (q0) are represented in
>         text as
>         the asterisk * wildcard ⊢
> 
>     character.
>         These conventions are used to encode unspecified state
>         transition
>         sequences.
> 
>     
> 
>     Definition
>             of Turing Machine H (state transition sequence)
> 
>     q0
>         Wm W * H qy 
>     
> 
>     q0
>         Wm W * H qn 
>     
> 
>     
> 
>     The
>         diagram and the state transition sequence indicate that H begins
>         at
>         its own start state and is
> 
>     applied
>         to TM description Wm with input W.
> 
>     
> 
>     The
>         Final state ((qy)) indicates that Turing Machine wM will halt on
>         its
>         input w (halts = yes).
> 
>     The
>         Final state ((qn)) indicates that Turing Machine wM will not
>         halt on
>         its input w (halts = no).
> 
>     
> 
>     Definition
>             of Turing Machine S (state transition sequence)
> 
>     q0
>         W ⊢* S qy ∞
> 
>     q0
>         W ⊢”E” S q1 ⊢”N” S q2 ⊢”D” S qn
> 
>     
> 
>     Turing
>         Machine S begins at start state q0
> 
>     S
>         transitions from q0 to q1 on “E” else qy ∞
> 
>     S
>         transitions from q1 to q2 on “N” else qy ∞
> 
>     S
>         transitions from q2 to q3 on “D” else qy ∞
> 
>     
> 
>     What
>             is the necessary sequence of the inference chain for halt
>             decider H
>             to decide: S “ENN” ? 
>     



Halt is not a LANGUAGE decider, it is a PROGRAM decider.


You dont put


----------------------------
00000000END00000000000
----------------------------


on the TURING TAPE and compute "YES" its in the LANGUAGE of ALLOWED STRINGS!



Nope!

a FINITE STATE MACHINE can do that!   NO TAPE NEEDED!




JUST USE EBNF



INPUT ::- INPUT INPUT
INPUT ::- e
INPUT ::- n
INPUT ::- d


It will parse all sentences in L using terminal symbols 'e' 'n' 'd' in any order

Back to sci.logic | Previous | Next — Next in thread | Find similar | Unroll thread


Thread

Re: Necessary sequence of halt decider's inference chain grahamcooper7@gmail.com - 2018-02-09 22:20 -0800
  Re: Necessary sequence of halt decider's inference chain Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-10 12:28 +0000
    Re: Necessary sequence of halt decider's inference chain Pete Olcott <Pete@NoEmail.address> - 2018-02-10 09:15 -0600
      Re: Necessary sequence of halt decider's inference chain Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-10 16:44 +0000
        Re: Necessary sequence of halt decider's inference chain grahamcooper7@gmail.com - 2018-02-10 15:16 -0800
    Re: Necessary sequence of halt decider's inference chain grahamcooper7@gmail.com - 2018-02-10 15:27 -0800
      Re: Necessary sequence of halt decider's inference chain Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-11 00:20 +0000
        Re: Necessary sequence of halt decider's inference chain grahamcooper7@gmail.com - 2018-02-10 17:21 -0800
          Re: Necessary sequence of halt decider's inference chain Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-11 01:38 +0000

csiph-web