Pages that link to "Item:Q579920"
From MaRDI portal
The following pages link to A connotational theory of program structure (Q579920):
Displaying 21 items.
- Hypothesis spaces for learning (Q553319) (← links)
- Computable one-to-one enumerations of effective domains (Q582908) (← links)
- A learning-theoretic characterization of classes of recursive functions (Q673668) (← links)
- Program self-reference in constructive Scott subdomains (Q693046) (← links)
- Characterizing programming systems allowing program self-reference (Q733737) (← links)
- Maximal machine learnable classes (Q1305936) (← links)
- Composition is almost (but not quite) as good as \(s-1-1\) (Q1314366) (← links)
- Program size restrictions in computational learning (Q1342242) (← links)
- Learning-theoretic perspectives of acceptable numberings (Q1380421) (← links)
- The synthesis of language learners. (Q1854290) (← links)
- Effectivity questions for Kleene's recursion theorem (Q2636408) (← links)
- Some independence results for control structures in complete numberings (Q2732286) (← links)
- Effectivity Questions for Kleene’s Recursion Theorem (Q3455838) (← links)
- Program Self-reference in Constructive Scott Subdomains (Q3576041) (← links)
- Spatial/kinematic domain and lattice computers (Q4290128) (← links)
- (Q4300060) (← links)
- Acceptable Numerations of Morphisms and Myhill‐Shepherdson Property (Q4323830) (← links)
- Learnability: Admissible, co-finite, and hypersimple languages (Q4630268) (← links)
- Parsimony hierarchies for inductive inference (Q5311725) (← links)
- Costs of general purpose learning (Q5941288) (← links)
- Control structures in hypothesis spaces: The influence on learning (Q5958309) (← links)
