On the inference of Turing machines from sample computations

DOI10.1016/0004-3702(72)90048-3zbMath0252.68019OpenAlexW2090943474MaRDI QIDQ2557559

Alan W. Biermann

Publication date: 1972

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(72)90048-3

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Inductive inference of recursive functions: Complexity bounds ⋮ On the transformation of logic programs with instantiation based computation rules ⋮ Theory construction in psychology: The interpretation and integration of psychological data ⋮ SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY ⋮ Total complexity and the inference of best programs ⋮ DEFINING STRUCTURAL DESCRIPTIONS ⋮ Programming by examples ⋮ Automatic insertion of indexing instructions in program synthesis ⋮ AN AUTOMATA-THEORETICAL APPROACH TO DEVELOPING LEARNING NEURAL NETWORKS ⋮ Automatic programming: A tutorial on formal methodologies

Cites Work

• Total complexity and the inference of best programs
• Realization of Input-Output Relations by Sequential Machines
• Toward automatic program synthesis
• Some decidability results on grammatical inference and complexity
• On the Synthesis of Finite-State Machines from Samples of Their Behavior
• Language identification in the limit
• A formal theory of inductive inference. Part II
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item