Pages that link to "Item:Q3248015"

The following pages link to TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944) (Q3248015):

Displayed 50 items.

• On \(n\)-tardy sets (Q435200) ‎ (← links)
• Computational processes, observers and Turing incompleteness (Q616506) ‎ (← links)
• Extending and interpreting Post's programme (Q636317) ‎ (← links)
• Undecidability and 1-types in the recursively enumerable degrees (Q688787) ‎ (← links)
• Incomparable prime ideals of recursively enumerable degrees (Q688789) ‎ (← links)
• The distribution of the generic recursively enumerable degrees (Q688848) ‎ (← links)
• Computing degrees of unsolvability (Q770790) ‎ (← links)
• Intervals containing exactly one c.e. degree (Q876386) ‎ (← links)
• An easy priority-free proof of a theorem of Friedberg (Q913786) ‎ (← links)
• On Lachlan's major sub-degree problem (Q943340) ‎ (← links)
• Classification of computably approximable real numbers (Q1015380) ‎ (← links)
• Post's problem for ordinal register machines: an explicit approach (Q1032632) ‎ (← links)
• Turing oracle machines, online computing, and three displacements in computability theory (Q1032637) ‎ (← links)
• Some remarks on witness functions for nonpolynomial and noncomplete sets in NP (Q1079364) ‎ (← links)
• Collapsing degrees (Q1109766) ‎ (← links)
• Not every finite lattice is embeddable in the recursively enumerable degrees (Q1142206) ‎ (← links)
• Coding a family of sets (Q1295408) ‎ (← links)
• Lattice nonembeddings and intervals of the recursively enumerable degrees (Q1802183) ‎ (← links)
• Representation of one-one degrees by decision problems for system functions (Q1837180) ‎ (← links)
• Orbits of computably enumerable sets: Low sets can avoid an upper cone (Q1849863) ‎ (← links)
• The bounded injury priority method and the learnability of unions of rectangles (Q1919530) ‎ (← links)
• Things that can be made into themselves (Q2252527) ‎ (← links)
• Call-by-value lambda calculus as a model of computation in Coq (Q2319993) ‎ (← links)
• On the Turing degrees of minimal index sets (Q2382278) ‎ (← links)
• An explicit solution to Post's problem over the reals (Q2479313) ‎ (← links)
• Recursively enumerable degress and the conjugacy problem (Q2533187) ‎ (← links)
• On the reducibility of \(\Pi_ 1^ 1\) sets (Q2547889) ‎ (← links)
• A pseudofundamental sequence that is not equivalent to any monotone sequence (Q2557693) ‎ (← links)
• Resource bounded immunity and simplicity (Q2576870) ‎ (← links)
• The minimum of two regressive isols (Q2626678) ‎ (← links)
• On the structures inside truth-table degrees (Q2747717) ‎ (← links)
• Extensions of embeddings below computably enumerable degrees (Q2838113) ‎ (← links)
• Computational classification of cellular automata (Q2869784) ‎ (← links)
• Forcing and reducibilities (Q3041177) ‎ (← links)
• Is it harder to factor a polynomial or to find a root? (Q3053472) ‎ (← links)
• Definability in the Recursively Enumerable Degrees (Q3128481) ‎ (← links)
• European Summer Meeting of the Association for Symbolic Logic, Uppsala 1991 (Q3138023) ‎ (← links)
• Definable incompleteness and Friedberg splittings (Q3149989) ‎ (← links)
• The Typical Constructible Object (Q3188247) ‎ (← links)
• Measure-theoretic construction of incomparable hyperdegrees (Q3256319) ‎ (← links)
• A minimal degree less than 0’ (Q3282934) ‎ (← links)
• Extensions of Hilbert’s Tenth Problem: Definability and Decidability in Number Theory (Q3305316) ‎ (← links)
• Hierarchy of Computably Enumerable Degrees II (Q3380356) ‎ (← links)
• Degree Structures: Local and Global Investigations (Q3412461) ‎ (← links)
• An extension of the nondiamond theorem in classical and α-recursion theory (Q3698790) ‎ (← links)
• Finite injury and <i>Σ</i>₁-induction (Q3824402) ‎ (← links)
• The existential theory of the poset of R.E. degrees with a predicate for single jump reducibility (Q4032885) ‎ (← links)
• Combinatorial systems defined over one- and two-letter alphabets (Q4103085) ‎ (← links)
• The decision problem for recursively enumerable degrees (Q4106188) ‎ (← links)
• Recursively enumerable sets and degrees (Q4184825) ‎ (← links)