A connotational theory of program structure
From MaRDI portal
Recommendations
Cited in
(26)- Maximal machine learnable classes
- Composition is almost (but not quite) as good as \(s-1-1\)
- Program size restrictions in computational learning
- Learning-theoretic perspectives of acceptable numberings
- The synthesis of language learners.
- Effectivity questions for Kleene's recursion theorem
- Some independence results for control structures in complete numberings
- Characteristics of minimal effective programming systems
- Effectivity questions for Kleene's recursion theorem
- Program self-reference in constructive Scott subdomains
- Spatial/kinematic domain and lattice computers
- scientific article; zbMATH DE number 605140 (Why is no real title available?)
- Acceptable Numerations of Morphisms and Myhill‐Shepherdson Property
- Learnability: admissible, co-finite, and hypersimple languages
- Parsimony hierarchies for inductive inference
- Hypothesis spaces for learning
- Computable one-to-one enumerations of effective domains
- Costs of general purpose learning
- Control structures in hypothesis spaces: The influence on learning
- Machine induction without revolutionary paradigm shifts
- A learning-theoretic characterization of classes of recursive functions
- Program self-reference in constructive Scott subdomains
- Constructivity conditions on immune sets
- Control structures in computable numberings and the completion operator
- Computably enumerable sets of reals in constructive mathematical analysis
- Characterizing programming systems allowing program self-reference
This page was built for publication: A connotational theory of program structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q579920)
