Pages that link to "Item:Q5845382"
From MaRDI portal
The following pages link to Recursively enumerable sets of positive integers and their decision problems (Q5845382):
Displayed 50 items.
- Representation theorems for recursively enumerable sets and a conjecture related to Poonen's large subring of \(\mathbb Q\) (Q393224) (← links)
- On \(n\)-tardy sets (Q435200) (← links)
- Syntactic structures and recursive devices: a legacy of imprecision (Q438595) (← links)
- On the mathematical foundations of \textit{Syntactic structures} (Q438597) (← links)
- A personal account of Turing's imprint on the development of computer science (Q465701) (← links)
- Hypothesis spaces for learning (Q553319) (← links)
- Survey of polynomial transformations between NP-complete problems (Q555184) (← links)
- On the classification of recursive languages (Q598240) (← links)
- Computational processes, observers and Turing incompleteness (Q616506) (← links)
- Extending and interpreting Post's programme (Q636317) (← links)
- Immunity and pseudorandomness of context-free languages (Q653340) (← links)
- Incomparable prime ideals of recursively enumerable degrees (Q688789) (← links)
- The distribution of the generic recursively enumerable degrees (Q688848) (← links)
- Computably enumerable sets and related issues (Q695800) (← links)
- Constructive dimension and Turing degrees (Q733739) (← links)
- Cook reducibility is faster than Karp reducibility in NP (Q751812) (← links)
- The factorial function for isols (Q770288) (← links)
- Computing degrees of unsolvability (Q770790) (← links)
- Recursive digraphs, splinters and cylinders (Q771093) (← links)
- On Lachlan's major sub-degree problem (Q943340) (← links)
- Does truth-table of linear norm reduce the one-query tautologies to a random oracle? (Q948913) (← links)
- A hierarchy below the halting problem for additive machines (Q1015375) (← links)
- Prescribed learning of r.e. classes (Q1017658) (← links)
- Turing oracle machines, online computing, and three displacements in computability theory (Q1032637) (← links)
- Emergence as a computability-theoretic phenomenon (Q1036528) (← links)
- Uncomputability and undecidability in economic theory (Q1036534) (← links)
- The density of the nonbranching degrees (Q1055403) (← links)
- Model-theoretic and algorithmic questions in group theory (Q1063112) (← links)
- The minimum degree of recursively representable choice functions (Q1072546) (← links)
- Reductions among polynomial isomorphism types (Q1077412) (← links)
- A class of hypersimple incomplete sets (Q1078559) (← links)
- On simple and creative sets in NP (Q1099614) (← links)
- Unsolvable algorithmic problems for semigroups, groups and rings (Q1117039) (← links)
- Structure of the upper semilattice of recursively enumerable m-degrees and related questions. I (Q1140636) (← links)
- Not every finite lattice is embeddable in the recursively enumerable degrees (Q1142206) (← links)
- Complexity of graph embeddability problems (Q1152224) (← links)
- Some observations on NP real numbers and P-selective sets (Q1164623) (← links)
- Some undecidable determined games (Q1171511) (← links)
- Undecidability and incompleteness in classical mechanics (Q1176394) (← links)
- Myhill's work in recursion theory (Q1192344) (← links)
- A comparison of polynomial time reducibilities (Q1223166) (← links)
- Polynomial and abstract subrecursive classes (Q1227276) (← links)
- tt- and m-degrees (Q1230623) (← links)
- \(r\)-maximal major subsets (Q1248505) (← links)
- One class of partial sets (Q1253250) (← links)
- Cappable recursively enumerable degrees and Post's program (Q1311427) (← links)
- The relative power of logspace and polynomial time reductions (Q1312179) (← links)
- Splitting theorems in recursion theory (Q1314544) (← links)
- On speedable and levelable vector spaces (Q1326776) (← links)
- Uncertainty, predictability and decidability in chaotic dynamical systems (Q1346395) (← links)