On the problem of finding minimal programs for tables

DOI10.1016/S0019-9958(69)90323-4MaRDI QIDQ5572336zbMATH OpenOpenAlexFDO

Authors David Pager

Publication date 1969

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(69)90323-4

zbMATH Keywords

recursion theory, constructive mathematics

Recommendations

• Short lists with short programs in short time
• On approximate decidability of minimal programs
• Coding with minimal programs
• On the Turing degrees of minimal index sets
• On minimal-program complexity measures

Cited in

(12)

• A numerical analysis of two point boundary value problem algorithms
• On the inference of optimal descriptions
• Finite approximate approach to the study of the complexity of recursive predicates
• Table approximations to recursive predicates
• Short lists with short programs in short time
• On approximate decidability of minimal programs
• THE FASTEST AND SHORTEST ALGORITHM FOR ALL WELL-DEFINED PROBLEMS
• scientific article; zbMATH DE number 4066332 (Why is no real title available?)
• 1997–98 Annual Meeting of the Association for Symbolic Logic
• 1998 European Summer Meeting of the Association for Symbolic Logic
• Coding with minimal programs
• An incomplete set of shortest descriptions

This page was built for publication: On the problem of finding minimal programs for tables

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