Turing Computability
From MaRDI portal
Publication:2864221
DOI10.1007/978-3-642-31933-4zbMath1350.03001OpenAlexW4238214510MaRDI QIDQ2864221
Publication date: 6 December 2013
Published in: Theory and Applications of Computability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-31933-4
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Computability and recursion theory (03Dxx)
Related Items (87)
The computational complexity of module socles ⋮ On \(p \)-universal and \(p \)-minimal numberings ⋮ Finite computable dimension and degrees of categoricity ⋮ The computability, definability, and proof theory of Artinian rings ⋮ Reduction games, provability and compactness ⋮ The Intersection of Algorithmically Random Closed Sets and Effective Dimension ⋮ Computability and the game of cops and robbers on graphs ⋮ On the Turing degrees of minimal index sets ⋮ Approximating approximate reasoning: fuzzy sets and the Ershov hierarchy ⋮ DEGREES OF RANDOMIZED COMPUTABILITY ⋮ Index sets for classes of positive preorders ⋮ The uniform content of partial and linear orders ⋮ Dominating the Erdős-Moser theorem in reverse mathematics ⋮ Coloring trees in reverse mathematics ⋮ Bounded low and high sets ⋮ On functors enumerating structures ⋮ Computable paradoxical decompositions ⋮ Sofic profiles of \(S(\omega)\) and computability ⋮ Formalism and intuition in computability ⋮ THE COMPUTATIONAL CONTENT OF INTRINSIC DENSITY ⋮ Orders on magmas and computability theory ⋮ On Low for Speed Oracles ⋮ COMPLEXITY OF INDEX SETS OF DESCRIPTIVE SET-THEORETIC NOTIONS ⋮ Algebraic properties of the first-order part of a problem ⋮ Ramsey’s theorem for singletons and strong computable reducibility ⋮ Decidability problem for exponential equations in finitely presented groups ⋮ Infinite dimensional proper subspaces of computable vector spaces ⋮ Numberings, c.e. oracles, and fixed points ⋮ From undecidability of non-triviality and finiteness to undecidability of learnability ⋮ Effective algebraicity ⋮ Effectively infinite classes of numberings of computable families of reals ⋮ Rogers semilattices of limitwise monotonic numberings ⋮ ON COHESIVE POWERS OF LINEAR ORDERS ⋮ ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS ⋮ THE DISCONTINUITY PROBLEM ⋮ The complexity of decomposability of computable rings ⋮ COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR ⋮ On two types of concept lattices in the theory of numberings ⋮ Classifying word problems of finitely generated algebras via computable reducibility ⋮ Computable Heyting algebras with distinguished atoms and coatoms ⋮ Degrees of categoricity of trees and the isomorphism problem ⋮ Effectively infinite classes of numberings and computable families of reals ⋮ Keeping logic in the trivium of computer science: a teaching perspective ⋮ On universal positive graphs ⋮ Enumeration reducibility and positive reducibility of the numberings of families of arithmetic sets ⋮ Turing degrees and randomness for continuous measures ⋮ Learning algebraic structures with the help of Borel equivalence relations ⋮ Relative order and spectrum in free and related groups ⋮ Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective ⋮ A family with a single minimal but not least numbering ⋮ THE TURING DEGREES AND KEISLER’S ORDER ⋮ Learning families of algebraic structures from informant ⋮ A NOTE ON THE REVERSE MATHEMATICS OF THE SORITES ⋮ Unnamed Item ⋮ A bounded jump for the bounded Turing degrees ⋮ From Mathesis Universalis to Provability, Computability, and Constructivity ⋮ Revisiting Chaitin's incompleteness theorem ⋮ The complexity of module radicals ⋮ Turing computable embeddings of equivalences other than isomorphism ⋮ ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS ⋮ Genericity for Mathias forcing over general Turing ideals ⋮ Continuity of capping in \(\mathcal C_{\text{bT}}\) ⋮ Scott sentences for certain groups ⋮ The fixed point problem of a simple reversible language ⋮ INTRINSIC SMALLNESS ⋮ The complexity of ascendant sequences in locally nilpotent groups ⋮ On low for speed oracles ⋮ Function operators spanning the arithmetical and the polynomial hierarchy ⋮ Weak reducibility of computable and generalized computable numberings ⋮ Unnamed Item ⋮ Categoricity spectra of computable structures ⋮ Unnamed Item ⋮ Putnam's diagonal argument and the impossibility of a universal learning machine ⋮ ON A METRIC GENERALIZATION OF THE tt-DEGREES AND EFFECTIVE DIMENSION THEORY ⋮ Computable permutations and word problems ⋮ On bi-embeddable categoricity of algebraic structures ⋮ Turing oracle machines, online computing, and three displacements in computability theory ⋮ Reasoning about arbitrary natural numbers from a Carnapian perspective ⋮ COH, SRT 2 2 , and multiple functionals ⋮ A packed Ramsey’s theorem and computability theory ⋮ On decidability of amenability in computable groups ⋮ THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS ⋮ REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION ⋮ Computing on the Banach space C [ 0 , 1 ] ⋮ Weak truth table degrees of structures ⋮ One note on positive A-computable numberings ⋮ Индексное множество автоустойчивых упорядоченных абелевых групп
This page was built for publication: Turing Computability
