Some independence results for control structures in complete numberings
From MaRDI portal
Publication:2732286
DOI10.2307/2694927zbMath0976.68042OpenAlexW2087869015MaRDI QIDQ2732286
Publication date: 2 January 2002
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.7224
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of numerations, effectively presented structures (03D45)
Related Items (1)
Cites Work
- Unnamed Item
- A learning-theoretic characterization of classes of recursive functions
- Inductive Inference and Computable One‐One Numberings
- Inductive inference of formal languages from positive data
- Theorie der Numerierungen I
- Characterization of language learning front informant under various monotonicity constraints
- A Machine-Independent Theory of the Complexity of Recursive Functions
This page was built for publication: Some independence results for control structures in complete numberings