On the inference of approximate programs

DOI10.1016/0304-3975(90)90170-MMaRDI QIDQ803121zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 4045112
• Approximation logic of programs
• Inferring program specifications in polynomial-time
• scientific article; zbMATH DE number 517034
• Approximation and contamination bounds for probabilistic programs
• Tradeoffs in the inductive inference of nearly minimal size programs
• scientific article; zbMATH DE number 3952736
• On approximate decidability of minimal programs
• Approximability of some program models by others
• A new approach to inference in approximate reasoning

Cites work

• scientific article; zbMATH DE number 3932417 (Why is no real title available?)
• scientific article; zbMATH DE number 3655912 (Why is no real title available?)
• scientific article; zbMATH DE number 3539202 (Why is no real title available?)
• scientific article; zbMATH DE number 3586480 (Why is no real title available?)
• scientific article; zbMATH DE number 3588047 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Comparison of identification criteria for machine inductive inference
• Criteria of language learning
• Inductive inference of approximations
• Language identification in the limit
• On the complexity of inductive inference
• On the error correcting power of pluralism in BC-type inductive inference
• On the power of probabilistic strategies in inductive inference
• Periodicity in generations of automata
• Probabilistic inductive inference
• Probability and plurality for aggregations of learning machines
• The Power of Pluralism for Automatic Program Synthesis
• Toward a mathematical theory of inductive inference
• Tradeoffs in the inductive inference of nearly minimal size programs

Cited in

(6)

• Approximate bit dependency analysis to identify program synthesis problems as infeasible
• Tradeoffs in the inductive inference of nearly minimal size programs
• Inductive inference of approximations
• scientific article; zbMATH DE number 3952736 (Why is no real title available?)
• scientific article; zbMATH DE number 4045112 (Why is no real title available?)
• On the error correcting power of pluralism in BC-type inductive inference

This page was built for publication: On the inference of approximate programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q803121)