On the Inference of Turing Machines from Sample Computations,

Abstract

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 any Turing machine by being led through a series of sample computations done by that machine. A number of examples illustrate the use of the techniques and the possibility of its application to other types of problems. (Author)

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1971
Accession Number
AD0732642

Entities

People

  • A. W. Biermann

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Artificial Intelligence
  • Automata
  • Computations
  • Machines
  • Mathematical Analysis

Fields of Study

  • Computer science

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Instructional Design and Training Evaluation.
  • Regression Analysis.

Technology Areas

  • AI & ML
  • AI & ML - Neural Networks