Computable one-to-one enumerations of effective domains
From MaRDI portal
Publication:582908
Recommendations
- scientific article; zbMATH DE number 4079405
- Effective domains and concrete computability: A survey
- Computability by means of effectively definable schemes and definability via enumerations
- Characterization of the effective computability in \({\mathfrak f}\)-enumerations
- Towards computability over effectively enumerable topological spaces
- Enumerations in computable structure theory
- Computability and totality in domains
- Computable elements and functions in effectively enumerable topological spaces
- On computably enumerable structures
- Some applications of computable one-one numberings
Cites work
- scientific article; zbMATH DE number 3987247 (Why is no real title available?)
- scientific article; zbMATH DE number 3653565 (Why is no real title available?)
- scientific article; zbMATH DE number 3664931 (Why is no real title available?)
- scientific article; zbMATH DE number 3745146 (Why is no real title available?)
- scientific article; zbMATH DE number 3596800 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3315195 (Why is no real title available?)
- A connotational theory of program structure
- Computability concepts for programming language semantics
- Computability theory in admissible domains
- Decomposition of Gödelnumberings into Friedbergnumberings
- Effectively given domains
- Godel Numberings Versus Friedberg Numberings
- The independence of control structures in abstract programming systems
- Theorie der Numerierungen I
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
Cited in
(5)
This page was built for publication: Computable one-to-one enumerations of effective domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582908)