On the inference of approximate programs
DOI10.1016/0304-3975(90)90170-MzbMATH Open0727.03029OpenAlexW1984004554MaRDI QIDQ803121FDOQ803121
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
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
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Toward a mathematical theory of inductive inference
- Criteria of language learning
- Title not available (Why is that?)
- Language identification in the limit
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Title not available (Why is that?)
- Probabilistic inductive inference
- The Power of Pluralism for Automatic Program Synthesis
- Periodicity in generations of automata
- On the power of probabilistic strategies in inductive inference
- Comparison of identification criteria for machine inductive inference
- On the complexity of inductive inference
- Tradeoffs in the inductive inference of nearly minimal size programs
- Inductive inference of approximations
- Probability and plurality for aggregations of learning machines
- Title not available (Why is that?)
- On the error correcting power of pluralism in BC-type inductive inference
- Title not available (Why is that?)
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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)
