Pages that link to "Item:Q2557559"
From MaRDI portal
The following pages link to On the inference of Turing machines from sample computations (Q2557559):
Displaying 10 items.
- Automatic programming: A tutorial on formal methodologies (Q1060833) (← links)
- On the transformation of logic programs with instantiation based computation rules (Q1119029) (← links)
- Theory construction in psychology: The interpretation and integration of psychological data (Q1157291) (← links)
- Programming by examples (Q1255776) (← links)
- DEFINING STRUCTURAL DESCRIPTIONS (Q3870341) (← links)
- AN AUTOMATA-THEORETICAL APPROACH TO DEVELOPING LEARNING NEURAL NETWORKS (Q3907076) (← links)
- SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY (Q4111346) (← links)
- Total complexity and the inference of best programs (Q4133125) (← links)
- Automatic insertion of indexing instructions in program synthesis (Q4188704) (← links)
- Inductive inference of recursive functions: Complexity bounds (Q4560353) (← links)
