The following pages link to Turing Computability (Q2864221):
Displaying 50 items.
- Infinite dimensional proper subspaces of computable vector spaces (Q402446) (← links)
- Genericity for Mathias forcing over general Turing ideals (Q503254) (← links)
- Limits of computation. From a programming perspective (Q518688) (← links)
- Continuity of capping in \(\mathcal C_{\text{bT}}\) (Q947265) (← links)
- Models of computation. An introduction to computability theory (Q1007225) (← links)
- Turing oracle machines, online computing, and three displacements in computability theory (Q1032637) (← links)
- Finite computable dimension and degrees of categoricity (Q1616772) (← links)
- The computability, definability, and proof theory of Artinian rings (Q1628418) (← links)
- Keeping logic in the trivium of computer science: a teaching perspective (Q1696593) (← links)
- Scott sentences for certain groups (Q1745362) (← links)
- Effective algebraicity (Q1935364) (← links)
- Revisiting Chaitin's incompleteness theorem (Q1982000) (← links)
- The complexity of module radicals (Q1982020) (← links)
- The fixed point problem of a simple reversible language (Q1989327) (← links)
- On low for speed oracles (Q2009647) (← links)
- Weak reducibility of computable and generalized computable numberings (Q2033333) (← links)
- Turing computability: structural theory (Q2036465) (← links)
- Categoricity spectra of computable structures (Q2036466) (← links)
- Putnam's diagonal argument and the impossibility of a universal learning machine (Q2051127) (← links)
- On bi-embeddable categoricity of algebraic structures (Q2067511) (← links)
- On decidability of amenability in computable groups (Q2085571) (← links)
- The computational complexity of module socles (Q2120972) (← links)
- On \(p \)-universal and \(p \)-minimal numberings (Q2123092) (← links)
- Computability and the game of cops and robbers on graphs (Q2144613) (← links)
- Approximating approximate reasoning: fuzzy sets and the Ershov hierarchy (Q2148810) (← links)
- Index sets for classes of positive preorders (Q2165608) (← links)
- The logic of Turing progressions (Q2176413) (← links)
- Learning families of algebraic structures from informant (Q2216113) (← links)
- Computable permutations and word problems (Q2314871) (← links)
- Reasoning about arbitrary natural numbers from a Carnapian perspective (Q2323694) (← links)
- Weak truth table degrees of structures (Q2354621) (← links)
- On the Turing degrees of minimal index sets (Q2382278) (← links)
- The uniform content of partial and linear orders (Q2400498) (← links)
- Dominating the Erdős-Moser theorem in reverse mathematics (Q2400499) (← links)
- Coloring trees in reverse mathematics (Q2401697) (← links)
- Bounded low and high sets (Q2402957) (← links)
- On functors enumerating structures (Q2403649) (← links)
- A bounded jump for the bounded Turing degrees (Q2452680) (← links)
- Sofic profiles of \(S(\omega)\) and computability (Q2663344) (← links)
- On universal positive graphs (Q2687461) (← links)
- Enumeration reducibility and positive reducibility of the numberings of families of arithmetic sets (Q2687468) (← links)
- Learning algebraic structures with the help of Borel equivalence relations (Q2689445) (← links)
- Computability. Turing, Gödel, Church, and beyond (Q2844489) (← links)
- Computability theory (Q2851819) (← links)
- Turing Machine-Inspired Computer Science Results (Q2904417) (← links)
- Formalism and intuition in computability (Q2941588) (← links)
- Algebraic Computability and Enumeration Models (Q2949142) (← links)
- Ramsey’s theorem for singletons and strong computable reducibility (Q2951171) (← links)
- Function operators spanning the arithmetical and the polynomial hierarchy (Q3060205) (← links)
- On Low for Speed Oracles (Q3304109) (← links)
