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


Groups > comp.theory > #40765

Re: I finally completed my lexical analyzer generator ( axiomatic basis )

Subject Re: I finally completed my lexical analyzer generator ( axiomatic basis )
Newsgroups comp.theory
References <TpydnRmO3dkGK-n8nZ2dnUU7-c3NnZ2d@giganews.com> <mY2dJ.3216$k35.2640@fx33.iad> <0e2dnU2hms9oXOn8nZ2dnUU7-SXNnZ2d@giganews.com> <4h4dJ.71260$qe4.24572@fx45.iad> <QJydnYuUluu0Tun8nZ2dnUU7-KvNnZ2d@giganews.com>
From Richard Damon <Richard@Damon-Family.org>
Message-ID <FKadJ.9264$Np3.5602@fx06.iad> (permalink)
Organization Forte - www.forteinc.com
Date 2021-10-24 06:40 -0400

Show all headers | View raw


On 10/23/21 11:29 PM, olcott wrote:
> On 10/23/2021 10:19 PM, Richard Damon wrote:
>> On 10/23/21 10:16 PM, olcott wrote:
>>> On 10/23/2021 8:49 PM, Richard Damon wrote:
>>>>
>>>> On 10/23/21 9:27 PM, olcott wrote:
>>>>> In order to make my halt decider a pure function it had to have a 
>>>>> way to look at the inputs to function calls. In order to look at 
>>>>> the inputs to function calls it had to know how many inputs that a 
>>>>> function has.
>>>>>
>>>>> This is DFA analyzes C source code to provide the number of 
>>>>> parameters of each function in the file. The number of parameters 
>>>>> per function is the number of {vt} matches per {fn} match.
>>>>>
>>>>> The only thing that will change with this file is that the halt 
>>>>> decider will use different halt deciding criteria so that the halt 
>>>>> decider becomes a pure function.
>>>>>
>>>>> https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation 
>>>>>
>>>>>
>>>>> In computer programming, a pure function is a function that has the 
>>>>> following properties:[1][2]
>>>>>
>>>>> (1) The function return values are identical for identical 
>>>>> arguments (no variation with local static variables, non-local 
>>>>> variables, mutable reference arguments or input streams).
>>>>>
>>>>> (2) The function application has no side effects (no mutation of 
>>>>> local static variables, non-local variables, mutable reference 
>>>>> arguments or input/output streams).
>>>>>
>>>>> https://en.wikipedia.org/wiki/Pure_function
>>>>>
>>>>>
>>>>>
>>>>> //
>>>>> //  Deterministic Finite Automaton (DFA) recognizer
>>>>> //  of C function headers.
>>>>>
>>>>> // Character Classes
>>>>> //
>>>>>      EMPTY [0]
>>>>>      ALPHA [ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz]
>>>>>    NUMERIC [0123456789]
>>>>>         WS [0x09,0x0A,0x0D,0x20]
>>>>>     LPAREN [(]
>>>>>     RPAREN [)]
>>>>>   ASTERISK [*]
>>>>>      COMMA [,]
>>>>>    COMMENT [0x2f]
>>>>>    NEWLINE [0x0A]
>>>>>      ASCII [0x20-0x7e]
>>>>>    CONTROL [0x00-0x09,0x0b-0x1f,0x7f]
>>>>>
>>>>>
>>>>> // Recognized Patterns
>>>>> //
>>>>> {et} Empty
>>>>> {ft} Function_Type
>>>>> {fn} Function_Name
>>>>> {vt} Variable_Type
>>>>> {vn} Variable_Name
>>>>> {fh} Function_Header
>>>>>
>>>>> // DFA Definition to recognize C function headers
>>>>>
>>>>> // begin of function type
>>>>> <00> WS    (00) ALPHA(01) NUMERIC(00) [*](00) [/](12)
>>>>> <01> WS{ft}(03) ALPHA(01) NUMERIC(01) [*](02)
>>>>> <02> WS{ft}(03) ALPHA(00) NUMERIC(00) [*](02)
>>>>>
>>>>> // begin of function name
>>>>> <03> WS    (03) ALPHA(04) NUMERIC(00) [*](00)
>>>>> <04> WS{fn}(05) ALPHA(04) NUMERIC(04) [*](00) [(]{fn}(06)
>>>>> <05> WS    (05) ALPHA(00) NUMERIC(00) [*](00) [(]    (06)
>>>>>
>>>>> // begin of variable type
>>>>> <06> WS    (06) ALPHA(07) NUMERIC(00) [*](00) [)]{fh}(00)
>>>>> <07> WS{vt}(09) ALPHA(07) NUMERIC(07) [*](08) [)]{fh}(00)
>>>>> <08> WS{vt}(09) ALPHA(00) NUMERIC(00) [*](08)
>>>>>
>>>>> // begin of variable name
>>>>> <09> WS    (09) ALPHA(10) NUMERIC(00) [*]    (00)
>>>>> <10> WS{vn}(11) ALPHA(10) NUMERIC(10) [,]{vn}(06) [)]{vn}(00)
>>>>> <11> WS    (11) ALPHA(00) NUMERIC(00) [,]    (06) [)]    (00)
>>>>>
>>>>> // ignores all "//" comments
>>>>> <12> WS     (00) ALPHA(01)  NUMERIC(00) [*](00) [/](13)
>>>>> <13> CONTROL(13) ASCII(13)  [0x0A] (00)
>>>>>
>>>>
>>>> Ok,
>>>>
>>>> Just remember that being a 'Pure Funciton' isn't the actual 
>>>> requirement, the decider needs to be a Mathematical Computation, 
>>>> which means that all copies of it, when given the same inputs, 
>>>> generates the same outputs.
>>>>
>>>> You STILL have the error that you treat H as a 'pure simulator' when 
>>>> it is not, it is only a 'pure simulatior until' and as such, the 
>>>> behavior of the copy of H in H^ DOES have an affect on the behavior 
>>>> of that H^. Remember, a 'Pure Simulator' (aka a UTM) NEVER stops 
>>>> simulating until the machine it is simulating ends, even if that 
>>>> takes forever.
>>>>
>>>
>>> void Infinite_Loop()
>>> {
>>>    HERE: goto HERE;
>>> }
>>>
>>> _Infinite_Loop()
>>> [00000ab0](01)  55              push ebp
>>> [00000ab1](02)  8bec            mov ebp,esp
>>> [00000ab3](02)  ebfe            jmp 00000ab3
>>> [00000ab5](01)  5d              pop ebp
>>> [00000ab6](01)  c3              ret
>>> Size in bytes:(0007) [00000ab6]
>>>
>>> Are you saying that the only way that a simulating halt decider can 
>>> correctly decide that the above code will never stop running is to 
>>> wait until the end of time?
>>>
>>
>> No. You seem to have a reading comprension problem.
>>
>> The Simulating Halt Decider is fully allowed to abort the simulation 
>> of the machine it is simulationg.
>>
>> The only issue is that IF it does so, it can't treat itself as if it 
>> was a UTM/Pure SImulator, and thus the fact that it never saw the 
>> comptation reach a halting state isn't proof of anything.
> 
> When a simulating halt decider acts as if it is a pure simulator and 
> watches the behavior of an infinite loop it can correctly abort the 
> simulation of this input and report that this input never halts. We can 
> generalize this simplest case of infinite execution to all other cases:
> 
> All that I am doing is generalizing this same idea. When-so-ever a 
> simulating halt decider can correctly axiomatically determine that its 
> input would never halt if it remained a pure simulator then it can abort 
> the simulation of this input and report that this input never halts.
> 
> When a simulating halt decider correctly axiomatically determines X then 
> we know that X is necessarily true.
> 
> 

NO!

You are making an INCORRECT generalization. It is just like claiming 
that log(a+b+c) is log(a) + log(b) + log(c) because we have the case 
that log(1+2+3) = log(1) + log(2) + log(3).

You have made a claim, PROVE IT. Not just a rhetorical argument done 
with vague words, but an honest to god actual analytical proof, using 
the exact same accepted definitions of all the words. And then go and 
prove that setup does meet the conditions required by the proof to use it.

You say 'axiomatically', but that is just YOUR DISHONEST DOGDE to insert 
in a statement that is FALSE.

Now, part of the problem is that you make a number of small errors that 
you continue to just ignore and these build up to your false conclusion.

Your statement would be correct if pronoun usage was correct and the 
usage refered to just this one COPY being adjusted, and not the shared 
copy being changed, which causes the change to change the supposed to be 
fixed algorithm employed by the input being simulated. We know that for 
THAT case, H is incorrect, as using an ACTUAL 'Pure Simulator' to 
process this input (where H^ still uses the original H that does abort) 
shows that H^ WILL HALT, and thus the claim "would not halt unless H 
aborts the simulation" is incorrect.

These errors have been pointed out to you repeatedly, but you continue 
to ignore them. Initially this could have just been passed off as 
carelessness, but your continuing shows that it can't just be that, but 
must be either stupidity, mental illness, or just that you are a liar.

Back to comp.theory | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread


Thread

I finally completed my lexical analyzer generator (needed by my halt decider) olcott <NoOne@NoWhere.com> - 2021-10-23 20:27 -0500
  Re: I finally completed my lexical analyzer generator (needed by my halt decider) Richard Damon <Richard@Damon-Family.org> - 2021-10-23 21:49 -0400
    Re: I finally completed my lexical analyzer generator (needed by my halt decider) olcott <NoOne@NoWhere.com> - 2021-10-23 21:16 -0500
      Re: I finally completed my lexical analyzer generator (needed by my halt decider) Richard Damon <Richard@Damon-Family.org> - 2021-10-23 23:19 -0400
        Re: I finally completed my lexical analyzer generator ( axiomatic basis ) olcott <NoOne@NoWhere.com> - 2021-10-23 22:29 -0500
          Re: I finally completed my lexical analyzer generator ( axiomatic basis ) Richard Damon <Richard@Damon-Family.org> - 2021-10-24 06:40 -0400
            Re: I finally completed my lexical analyzer generator ( axiomatic basis ) olcott <NoOne@NoWhere.com> - 2021-10-24 09:04 -0500
              Re: I finally completed my lexical analyzer generator ( axiomatic basis ) Richard Damon <Richard@Damon-Family.org> - 2021-10-24 13:37 -0400
                Re: I finally completed my lexical analyzer generator ( semantic tautology ) olcott <NoOne@NoWhere.com> - 2021-10-25 10:02 -0500
                Re: I finally completed my lexical analyzer generator ( semantic tautology ) Richard Damon <Richard@Damon-Family.org> - 2021-10-25 19:40 -0400
  Re: I finally completed my lexical analyzer generator (needed by my halt decider) Richard Damon <Richard@Damon-Family.org> - 2021-10-24 07:59 -0400
    Re: I finally completed my lexical analyzer generator (needed by my halt decider) olcott <NoOne@NoWhere.com> - 2021-10-24 09:07 -0500
      Re: I finally completed my lexical analyzer generator (needed by my halt decider) Richard Damon <Richard@Damon-Family.org> - 2021-10-24 13:41 -0400
  Re: I finally completed my lexical analyzer generator (needed by my halt decider) update olcott <NoOne@NoWhere.com> - 2021-10-24 13:37 -0500
    Re: I finally completed my lexical analyzer generator (needed by my halt decider) update Richard Damon <Richard@Damon-Family.org> - 2021-10-24 15:55 -0400
    Re: I finally completed my lexical analyzer generator (needed by my halt decider) update Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-25 02:08 +0100
      Re: I finally completed my lexical analyzer generator (needed by my halt decider) update olcott <NoOne@NoWhere.com> - 2021-10-24 20:45 -0500
        Re: I finally completed my lexical analyzer generator (needed by my halt decider) update Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-26 00:26 +0100
          Re: I finally completed my lexical analyzer generator (needed by my halt decider) update olcott <NoOne@NoWhere.com> - 2021-10-25 19:08 -0500
            Re: I finally completed my lexical analyzer generator (needed by my halt decider) update Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-26 02:09 +0100
              Re: I finally completed my lexical analyzer generator (needed by my halt decider) update olcott <NoOne@NoWhere.com> - 2021-10-25 20:54 -0500
                Re: I finally completed my lexical analyzer generator (needed by my halt decider) update Richard Damon <news.x.richarddamon@xoxy.net> - 2021-10-26 07:00 -0400
                Re: I finally completed my lexical analyzer generator (needed by my halt decider) update Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-26 14:56 +0100
                Re: I finally completed my lexical analyzer generator (needed by my halt decider) update olcott <NoOne@NoWhere.com> - 2021-10-26 09:43 -0500
                Re: I finally completed my lexical analyzer generator (needed by my halt decider) update Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-26 23:47 +0100

csiph-web