The following pages link to (Q3819052):
Displaying 50 items.
- Post's problem for ordinal register machines: an explicit approach (Q1032632) (← links)
- A non-splitting theorem in the enumeration degrees (Q1032639) (← links)
- Martin's conjecture and strong ergodicity (Q1042438) (← links)
- Lattice-valued fuzzy Turing machines: computing power, universality and efficiency (Q1043325) (← links)
- Completely mitotic r. e. degrees (Q1092895) (← links)
- Classification of degree classes associated with r.e. subspaces (Q1092898) (← links)
- Recursively enumerable \(m\)- and \(tt\)-degrees. II: The distribution of singular degrees (Q1094415) (← links)
- Diagonalizations over polynomial time computable sets (Q1107526) (← links)
- Collapsing degrees (Q1109766) (← links)
- An improved zero-one law for algorithmically random sequences (Q1127324) (← links)
- Index sets of classes of hyper-hypersimple sets (Q1174056) (← links)
- Domain theory in logical form (Q1174593) (← links)
- The density of the low\(_ 2\) \(n\)-r.e. degrees (Q1179531) (← links)
- Some effects of Ash-Nerode and other decidability conditions on degree spectra (Q1182431) (← links)
- Uncountable degree spectra (Q1182483) (← links)
- The d.r.e. degrees are not dense (Q1182487) (← links)
- Automorphisms of the lattice of recursively enumerable sets: Orbits (Q1186287) (← links)
- Myhill's work in recursion theory (Q1192344) (← links)
- On co-simple isols and their intersection types (Q1192351) (← links)
- Nondiamond theorems for polynomial time reducibility (Q1201882) (← links)
- The \(n\)-rea enumeration degrees are dense (Q1204114) (← links)
- Index sets of quotient objects of the Post numeration (Q1263578) (← links)
- Turing degrees of certain isomorphic images of computable relations (Q1295383) (← links)
- Approximation methods in inductive inference (Q1295388) (← links)
- Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I (Q1295392) (← links)
- Splitting theorems and the jump operator (Q1295399) (← links)
- Learning via queries and oracles (Q1295409) (← links)
- Recursive and nonextendible functions over the reals; filter foundation for recursive analysis. II (Q1302291) (← links)
- Cappable recursively enumerable degrees and Post's program (Q1311427) (← links)
- Computational foundations of basic recursive function theory (Q1314348) (← links)
- Splitting theorems in recursion theory (Q1314544) (← links)
- Gap-definable counting classes (Q1318473) (← links)
- Recursive versus recursively enumerable binary relations (Q1319364) (← links)
- Extremes in the degrees of inferability (Q1319507) (← links)
- Computational depth and reducibility (Q1334655) (← links)
- Classification of the index sets of low \([n]^ p\) and high \([n]^ p\) (Q1337641) (← links)
- Bounded recursively enumerable sets and degrees (Q1338024) (← links)
- Learning recursive functions from approximations (Q1370868) (← links)
- Infinite versions of some problems from finite complexity theory (Q1374209) (← links)
- Learning-theoretic perspectives of acceptable numberings (Q1380421) (← links)
- A blend of methods of recursion theory and topology. (Q1412834) (← links)
- Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures (Q1430995) (← links)
- Effectively closed sets and graphs of computable real functions. (Q1607292) (← links)
- Presentations of computably enumerable reals. (Q1607305) (← links)
- Inductive inference with additional information. (Q1608312) (← links)
- Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees (Q1612486) (← links)
- Enumeration 1-genericity in the local enumeration degrees (Q1633891) (← links)
- Refining the taming of the reverse mathematics zoo (Q1633897) (← links)
- A representation of recursively enumerable sets through Horn formulas in higher recursion theory (Q1677584) (← links)
- Seas of squares with sizes from a \(\Pi_{1}^{0}\) set (Q1686319) (← links)
