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.
- On the classification of recursive languages (Q598240) (← links)
- Incomparable prime ideals of recursively enumerable degrees (Q688789) (← links)
- The distribution of the generic recursively enumerable degrees (Q688848) (← 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)
- 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)
- Almost every set in exponential time is P-bi-immune (Q1349712) (← links)
- Expository notes on computability and complexity in (arithmetical) games (Q1391661) (← links)
- Turing degrees of hypersimple relations on computable structures (Q1399102) (← links)
- The modal argument for hypercomputing minds (Q1434374) (← links)
- Weakly useful sequences (Q1776400) (← links)
- Lattice nonembeddings and intervals of the recursively enumerable degrees (Q1802183) (← links)
- Initial segments of the degrees of size \(\aleph _ 1\) (Q1820153) (← links)
- Effectively hyperimmune sets and majorants (Q1820774) (← links)
- Classes of recursively enumerable sets and Q-reducibility (Q1823932) (← links)
- Hyperhypersimple sets and \(\Delta _ 2\) systems (Q1823933) (← links)
- Representation of one-one degrees by decision problems for system functions (Q1837180) (← links)
- Model checking mobile ambients (Q1884885) (← links)
- There is no fat orbit (Q1923566) (← links)
- An explicit solution to Post's problem over the reals (Q2479313) (← links)
- Small \(\Pi^{0}_{1}\) classes (Q2491076) (← links)
- Effective bounds for convergence, descriptive complexity, and natural examples of simple and hypersimple sets (Q2500468) (← links)
- An answer to a question by P. R. Young (Q2543321) (← links)