On the inference of Turing machines from sample computations
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3131080 (Why is no real title available?)
- scientific article; zbMATH DE number 3167394 (Why is no real title available?)
- scientific article; zbMATH DE number 3435053 (Why is no real title available?)
- scientific article; zbMATH DE number 3438431 (Why is no real title available?)
- scientific article; zbMATH DE number 3244957 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- scientific article; zbMATH DE number 3314813 (Why is no real title available?)
- scientific article; zbMATH DE number 3402108 (Why is no real title available?)
- scientific article; zbMATH DE number 3403744 (Why is no real title available?)
- A formal theory of inductive inference. Part II
- Language identification in the limit
- On the Synthesis of Finite-State Machines from Samples of Their Behavior
- Realization of Input-Output Relations by Sequential Machines
- Some decidability results on grammatical inference and complexity
- Total complexity and the inference of best programs
- Toward automatic program synthesis
Cited in
(10)- Total complexity and the inference of best programs
- AN AUTOMATA-THEORETICAL APPROACH TO DEVELOPING LEARNING NEURAL NETWORKS
- Inductive inference of recursive functions: complexity bounds
- DEFINING STRUCTURAL DESCRIPTIONS
- SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY
- Theory construction in psychology: The interpretation and integration of psychological data
- Programming by examples
- Automatic insertion of indexing instructions in program synthesis
- Automatic programming: A tutorial on formal methodologies
- On the transformation of logic programs with instantiation based computation rules
This page was built for publication: On the inference of Turing machines from sample computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2557559)
