On 7/22/2022 4:12 PM, olcott wrote:
> On 7/22/2022 3:51 PM, Skep Dick wrote:
>> On Friday, 22 July 2022 at 22:08:28 UTC+2, olcott wrote:
>>> I do this by showing the criteria that humans use to recognize ordinary
>>> infinite recursion between two functions.
>> The criteria humans use are not applicable to Turing machines.
>> Because Turing-decidability and Human-decidability are not the same
> If Turing machines cannot not see what humans see then Turing machines
> may be an incorrect model of computation.
Please stop cutting out the immediate context, leave at least the last
If a Turing Machines cannot see that the input to a halt decider
specifies infinitely recursive simulation and humans can see this then
Turing machines must be not the best model of computation.
*Includes link to the entire halt deciding system including a link to*
*the compiler that compiles it: Microsoft Visual Studio Community 2017*
*Halting problem proofs refuted on the basis of software engineering* ?