On 7/15/2022 9:39 PM, Richard Damon wrote:
>
> On 7/15/22 10:27 PM, olcott wrote:
>> On 7/15/2022 9:12 PM, Richard Damon wrote:
>>> On 7/15/22 9:57 PM, olcott wrote:
>>>> On 7/15/2022 8:47 PM, Richard Damon wrote:
>>>>> On 7/15/22 9:36 PM, olcott wrote:
>>>>>> On 7/15/2022 8:05 PM, Richard Damon wrote:
>>>>>>> On 7/15/22 7:56 PM, olcott wrote:
>>>>>>>> On 7/15/2022 6:38 PM, Richard Damon wrote:
>>>>>>>>> On 7/15/22 11:07 AM, olcott wrote:
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> So you don't know how static variables work?
>>>>>>>>>> I am not surprised.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> And you don't understand that static variable don't pass
>>>>>>>>> between seperate instance of a computation?
>>>>>>>>>
>>>>>>>>> That violates the function of only its input rule.
>>>>>>>>>
>>>>>>>>
>>>>>>>> I know that and it took me nine months to overcome that issue.
>>>>>>>>
>>>>>>>> Because H is a Pure function1 it would seem to implement a
>>>>>>>> Computable function2 thus would be Turing computable.
>>>>>>>>
>>>>>>>> 1 https://en.wikipedia.org/wiki/Pure_function
>>>>>>>>
>>>>>>>> 2 https://en.wikipedia.org/wiki/Computable_function
>>>>>>>
>>>>>>> So, ALL calls to H(P,P) behave the same? From YOUR reference:
>>>>>>>
>>>>>>>> the function return values are identical for identical arguments
>>>>>>>> (no variation with local static variables, non-local variables,
>>>>>>>> mutable reference arguments or input streams)
>>>>>>> That means that when P(P) calls H(P,P) it gets the exact same
>>>>>>> response as when main calls H(P,P)? (so since you claim the
>>>>>>> H(P,P) called by main gets "correctly" returned a 0, the the call
>>>>>>> in P will do the same).
>>>>>> That you (and Flibble) continue to fail to understand the very
>>>>>> basic software engineering principle that no function called in
>>>>>> infinite recursion ever returns to its caller (even if computer
>>>>>> science textbooks command that it must) causes me to ignore many
>>>>>> of your posts.
>>>>>>
>>>>>
>>>>> Then you admit that H isn't actually a pure function, as a pure
>>>>> function MUST behave the same for ALL calls to it.
>>>>
>>>> A pure function is not allowed to return to any caller that calls it
>>>> in infinite recursion. It is ridiculously stupid of you to think
>>>> otherwise.
>>>
>>> IF it doesn't return the answer to P, then it doesn't return the
>>> answer to main, or it isn't a pure function.
>>>>
>>>>
>>>> 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), and
>>>
>>> RIGHT. So NOT RETURNING in one case means NOT RETURNING in ALL.
>> When the pure function returns a value (not when it is called in
>> infinite recursion where it returns no value) then it must always
>> return the same value for the same inputs.
>>
>
> Nope, it ALWAYS returns (or not) the same value for ALL Calls.
>

Except in the case of a halt decider such that the outer-most invocation
can abort the simulation of one that calls its in infinite recursion.

I can't think of any other example where any function called with the
same input would be called in infinite recursion in one instance and not
in another.

--
Copyright 2022 Pete Olcott

"Talent hits a target no one else can hit;
Genius hits a target no one else can see."
Arthur Schopenhauer