Re: The philosophy of computation reformulates existing ideas on a new basis ---

Am Tue, 29 Oct 2024 09:58:50 -0500 schrieb olcott:

On 10/29/2024 9:50 AM, Andy Walker wrote:

On 29/10/2024 13:56, olcott wrote:

To the best of my knowledge no one besides me ever came up with the
idea of making a simulating halt decider / emulating termination
analyzer.

     The /idea/ is ancient, and certainly dates back at least to
     the
1970s.  For a relatively informal discussion, see paragraph 3 of
   http://www.cuboid.me.uk/anw/G12FCO/lect18.html
 

The word "simulate" or "UTM" or "interpret" was not there.
Let me know what keyword to search for I have to prepare my house for my
cancer treatment.

The key word is "see". Oh wait, that's "emulate", which you haven't
explained the relevant difference from simulation of. Please keep
us posted about your health.

intended for second-year undergraduates and present on the web from
1996 [though then as a Nottingham University web page].  I certainly
didn't invent the idea.  The same page includes some stuff about Busy
Beavers.
You, and perhaps others, may also find some of the surrounding pages
[linked from that one] interesting, eg the stuff about UTMs and about
minimal computers.  Again, I am not claiming credit for inventing any
of this.

--
Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
It is not guaranteed that n+1 exists for every n.