The following pages link to Turing Computability (Q2864221):
Displaying 50 items.
- From Mathesis Universalis to Provability, Computability, and Constructivity (Q3305633) (← links)
- THE COMPUTATIONAL CONTENT OF INTRINSIC DENSITY (Q4579823) (← links)
- Orders on magmas and computability theory (Q4579847) (← links)
- (Q4585068) (← links)
- COH, SRT 2 2 , and multiple functionals (Q4995606) (← links)
- REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION (Q5009679) (← links)
- (Q5028441) (← links)
- Reduction games, provability and compactness (Q5055312) (← links)
- The Intersection of Algorithmically Random Closed Sets and Effective Dimension (Q5056370) (← links)
- DEGREES OF RANDOMIZED COMPUTABILITY (Q5067871) (← links)
- Computable paradoxical decompositions (Q5084297) (← links)
- (Q5099789) (← links)
- COMPLEXITY OF INDEX SETS OF DESCRIPTIVE SET-THEORETIC NOTIONS (Q5100042) (← links)
- Degrees of categoricity of trees and the isomorphism problem (Q5108865) (← links)
- INTRINSIC SMALLNESS (Q5159488) (← links)
- ON A METRIC GENERALIZATION OF THE tt-DEGREES AND EFFECTIVE DIMENSION THEORY (Q5222533) (← links)
- A packed Ramsey’s theorem and computability theory (Q5247024) (← links)
- A NOTE ON THE REVERSE MATHEMATICS OF THE SORITES (Q5381030) (← links)
- Turing computable embeddings of equivalences other than isomorphism (Q5401521) (← links)
- ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS (Q5401598) (← links)
- The complexity of ascendant sequences in locally nilpotent groups (Q5418658) (← links)
- (Q5419738) (← links)
- THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS (Q5855748) (← links)
- Computing on the Banach space C [ 0 , 1 ] (Q5859846) (← links)
- One note on positive A-computable numberings (Q5876870) (← links)
- Индексное множество автоустойчивых упорядоченных абелевых групп (Q5878775) (← links)
- Algebraic properties of the first-order part of a problem (Q6040614) (← links)
- Decidability problem for exponential equations in finitely presented groups (Q6052785) (← links)
- Numberings, c.e. oracles, and fixed points (Q6062177) (← links)
- From undecidability of non-triviality and finiteness to undecidability of learnability (Q6064265) (← links)
- Effectively infinite classes of numberings of computable families of reals (Q6086824) (← links)
- Rogers semilattices of limitwise monotonic numberings (Q6094148) (← links)
- ON COHESIVE POWERS OF LINEAR ORDERS (Q6095969) (← links)
- ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS (Q6095972) (← links)
- THE DISCONTINUITY PROBLEM (Q6095979) (← links)
- The complexity of decomposability of computable rings (Q6100980) (← links)
- COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR (Q6103452) (← links)
- Classifying word problems of finitely generated algebras via computable reducibility (Q6116397) (← links)
- Computable Heyting algebras with distinguished atoms and coatoms (Q6117138) (← links)
- Effectively infinite classes of numberings and computable families of reals (Q6146823) (← links)
- Turing degrees and randomness for continuous measures (Q6178468) (← links)
- Relative order and spectrum in free and related groups (Q6186944) (← links)
- Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective (Q6201447) (← links)
- A family with a single minimal but not least numbering (Q6203338) (← links)
- THE TURING DEGREES AND KEISLER’S ORDER (Q6203559) (← links)
- On Non-principal Arithmetical Numberings and Families (Q6489320) (← links)
- The Ginsburg-Sands theorem and computability theory (Q6492253) (← links)
- Essential hereditary undecidability (Q6565566) (← links)
- Effectively infinite classes of numberings and fixed point theorems (Q6587480) (← links)
- Ax-Kochen-Ershov principles for finitely ramified Henselian fields (Q6631321) (← links)
