On the inference of approximate programs

DOI10.1016/0304-3975(90)90170-MzbMath0727.03029OpenAlexW1984004554MaRDI QIDQ803121

Carl H. Smith, Mahendran Velauthapillai

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(90)90170-m

zbMATH Keywords

approximation of programscorrect programsdensity classesInductive Inference Machine

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Applications of computability and recursion theory (03D80) Turing machines and related notions (03D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• On the power of probabilistic strategies in inductive inference
• On the error correcting power of pluralism in BC-type inductive inference
• Probability and plurality for aggregations of learning machines
• Tradeoffs in the inductive inference of nearly minimal size programs
• On the complexity of inductive inference
• Probabilistic inductive inference
• The Power of Pluralism for Automatic Program Synthesis
• Periodicity in generations of automata
• Toward a mathematical theory of inductive inference
• Inductive inference of approximations
• Criteria of language learning
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Language identification in the limit