On the inference of Turing machines from sample computations

摘要

An algorithm is presented which when given a complete description of a set of Turing machine computations finds a Turing machine which is capable of doing those computations. This algorithm can serve as the basis for designing a trainable device which can be trained to simulate a Turing machine by being led through a series of sample computations done by that machine. A number of examples illustrate the use of the technique and the possibility of its application to other types of problems.