Pages that link to "Item:Q3260571"
From MaRDI portal
The following pages link to Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication (Q3260571):
Displayed 40 items.
- On Splits of Computably Enumerable Sets (Q2970977) (← links)
- Closed Left-R.E. Sets (Q3010403) (← links)
- On a positive set theory with inequality (Q3096082) (← links)
- Prescribed Learning of R.E. Classes (Q3520050) (← links)
- Learning in Friedberg Numberings (Q3520051) (← links)
- Numberings Optimal for Learning (Q3529939) (← links)
- Numberings and Randomness (Q3576037) (← links)
- Index Sets and Universal Numberings (Q3576059) (← links)
- Hypothesis Spaces for Learning (Q3618566) (← links)
- Hyperarithmetical Index Sets in Recursion Theory (Q3797173) (← links)
- A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets (Q3880826) (← links)
- Strong reducibilities (Q3942949) (← links)
- Optimal enumerations and optimal gödel numberings (Q4075448) (← links)
- Syntax and semantics of universal programming languages (Q4130955) (← links)
- INPUT/OUTPUT CODINGS AND TRANSITION FUNCTIONS IN EFFECTIVE SYSTEMS (Q4162665) (← links)
- Recursively enumerable sets and degrees (Q4184825) (← links)
- Inductive inference of recursive functions: Qualitative theory (Q4560352) (← links)
- A Friedberg enumeration of equivalence structures (Q4596664) (← links)
- On the Lattice of Recursively Enumerable Sets (Q4767304) (← links)
- European Summer Meeting of the Association for Symbolic Logic (Q4837676) (← links)
- Enumerations of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msubsup><mml:mi mathvariant="normal">Π</mml:mi><mml:mn>1</mml:mn><mml:mn>0</mml:mn></mml:msubsup></mml:math> Classes: Acceptability and Decid (Q4921447) (← links)
- COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS (Q4984865) (← links)
- Definitional schemes for primitive recursive and computable functions (Q5037214) (← links)
- A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE (Q5207555) (← links)
- On Reducibility by Recursive Functions (Q5344161) (← links)
- Metarecursively enumerable sets and admissible ordinals (Q5528641) (← links)
- Two Theorems on Hyperhypersimple Sets (Q5534208) (← links)
- Complete Recursively Enumerable Sets (Q5536627) (← links)
- On the Degrees of Index Sets. II (Q5577087) (← links)
- A theorem on hyperhypersimple sets (Q5607996) (← links)
- A Theorem on Recursively Enumerable Classes and Splinters (Q5607997) (← links)
- Recursively enumerable classes and their application to recursive sequences of formal theories (Q5652663) (← links)
- Friedberg numberings in the Ershov hierarchy (Q5899647) (← links)
- Friedberg numberings in the Ershov hierarchy (Q5919177) (← links)
- Weakly computable real numbers (Q5925970) (← links)
- Kolmogorov entropy in the context of computability theory (Q5958279) (← links)
- Control structures in hypothesis spaces: The influence on learning (Q5958309) (← links)
- Two theorems on minimal generalized computable numberings (Q6052274) (← links)
- Extremal numberings and fixed point theorems (Q6094162) (← links)
- Effectively infinite classes of numberings and computable families of reals (Q6146823) (← links)