Program size in restricted programming languages
From MaRDI portal
Publication:4055150
DOI10.1016/S0019-9958(72)90592-XzbMath0301.68019OpenAlexW1963765105MaRDI QIDQ4055150
Publication date: 1972
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(72)90592-x
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) General topics in the theory of software (68N01)
Related Items (25)
1997–98 Annual Meeting of the Association for Symbolic Logic ⋮ 1998 European Summer Meeting of the Association for Symbolic Logic ⋮ On the sizes of DPDAs, PDAs, LBAs ⋮ On the Turing degrees of minimal index sets ⋮ Why it might pay to assume that languages are infinite ⋮ Program Size Complexity of Correction Grammars in the Ershov Hierarchy ⋮ Index sets in the arithmetical hierarchy ⋮ Infinitary self-reference in learning theory ⋮ On Goedel speed-up and succinctness of language representations ⋮ Complexity of algorithms and computations ⋮ The independence of control structures in abstract programming systems ⋮ A note on natural complete sets and Goedel numberings ⋮ Optimal enumerations and optimal gödel numberings ⋮ Unnamed Item ⋮ An incomplete set of shortest descriptions ⋮ Anomalous learning helps succinctness ⋮ Index Sets and Universal Numberings ⋮ Index sets and universal numberings ⋮ The functions of finite support: a canonical learning problem ⋮ Searching for shortest and least programs ⋮ Table approximations to recursive predicates ⋮ Model discrimination using an algorithmic information criterion ⋮ On Approximate Decidability of Minimal Programs ⋮ Effective choice functions and index sets ⋮ Bounded Immunity and Btt-Reductions
This page was built for publication: Program size in restricted programming languages
