Cheap and Secure Web Hosting Provider : See Now

[Solved]: m-functions in Turing's paper "On Computable Numbers and applications..."

, , No Comments
Problem Detail: 

I was reading Alan Turing's paper "On Computable Numbers with an Application to the Entscheidungsproblem".

I was reading well until I encountered "4. Abbreviated Tables", page 235-236, where Turing uses a new way of writing a computation table for a machine. I am totally lost here. I don not understand the examples he gives (starting from page 236) to explain the idea of skeleton tables.

I need help with understanding how skeleton tables are to be read, and what they mean.

Asked By : Sidd

Answered By : André Souza Lemos

m-functions are quite similar to what we call today "macros". $f(\dots)$ is just the name of a supplementary m-configuration, that can be parameterized (like a macro). The trick is to not overthink it.

Best Answer from StackOverflow

Question Source :

3.2K people like this

 Download Related Notes/Documents


Post a Comment

Let us know your responses and feedback