Toward a mathematical theory of inductive inference

Information and Control

Volumn 28, Issue 2, 1975, Pages 125-155

  Blum, Lenore ^a,b   Blum, Manuel ^b  

^a MILLS COLLEGE   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

EID: 0016521417     PISSN: 00199958     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0019-9958(75)90261-2     Document Type: Article

References (27)

1. On the prediction of general recursive functions
2. On the Inference of Turing Machines from Sample Computations
3. A machine-independent theory of the complexity of recursive functions
4. On the inference of optimal descriptions
5. Some decidability results on grammatical inference and complexity
6. Language identification in the limit
7. A study of Grammatical Inference
8. staggered0-Theories
9. Logics of Discovery
10. The definition of random sequences
11. Computational speed-up by effective operators
12. A Procedure to Determining by Observation the State Diagram of a Turing Machine
13. Trial and error predicates and the solution to a problem of Mostowski
14. A formal theory of inductive inference
15. A formal theory of inductive inference
16. Iterated limiting recursion and the program minimization problem
17. Representative samples of programmable functions