Program size in restricted programming languages
From MaRDI portal
Cited in
(26)- An incomplete set of shortest descriptions
- Constructivity conditions on immune sets
- The functions of finite support: a canonical learning problem
- Optimal enumerations and optimal gödel numberings
- Table approximations to recursive predicates
- Model discrimination using an algorithmic information criterion
- Index sets and universal numberings
- 1997–98 Annual Meeting of the Association for Symbolic Logic
- 1998 European Summer Meeting of the Association for Symbolic Logic
- Index sets and universal numberings
- On the sizes of DPDAs, PDAs, LBAs
- The independence of control structures in abstract programming systems
- Index sets in the arithmetical hierarchy
- Infinitary self-reference in learning theory
- On approximate decidability of minimal programs
- Complexity of algorithms and computations
- Program size complexity of correction grammars in the Ershov hierarchy
- scientific article; zbMATH DE number 3443638 (Why is no real title available?)
- On the Turing degrees of minimal index sets
- Searching for shortest and least programs
- Why it might pay to assume that languages are infinite
- Effective choice functions and index sets
- On Goedel speed-up and succinctness of language representations
- Bounded Immunity and Btt-Reductions
- Anomalous learning helps succinctness
- A note on natural complete sets and Goedel numberings
This page was built for publication: Program size in restricted programming languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4055150)
