scientific article; zbMATH DE number 3387326
From MaRDI portal
Publication:5656753
zbMath0245.02037MaRDI QIDQ5656753
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items
Two theorems on degrees of models of true arithmetic, A hierarchy of families of recursively enumerable degrees, Degrees of Transducibility, Social choice and computational complexity, Математические основы теории познания на основе экспериментов, Lower bounds on degrees of game-theoretic structures, Priority arguments in the continuous r.e. degrees, Degrees of Unsolvability: A Tutorial, Rice’s Theorem in Effectively Enumerable Topological Spaces, Spectrum of the field of computable real numbers, Machine learning of higher-order programs, Transducer degrees: atoms, infima and suprema, Axiomatizing the existential theory of \(\mathbb{F}_q((t))\), Unnamed Item, Some elementary degree-theoretic reasons why structures need similarity types, Automorphism bases for degrees of unsolvability, Decreasing diagrams with two labels are complete for confluence of countable systems, Degrees of Infinite Words, Polynomials and Atoms, Branching Degrees above low Degrees, Independent Gödel sentences and independent sets, Anomalous learning helps succinctness, On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making, Computably enumerable sets and related issues, Post's problem and his hypersimple set, Comparison of identification criteria for machine inductive inference, The irregular and non-hyperregular \(\alpha\)-r.e. degrees, \(r\)-maximal major subsets, A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE, Generalized rewrite theories, coherence completion, and symbolic methods, Unnamed Item, Some lowness properties and computational complexity sequences, α-Degrees of maximal α-r.e. sets, Computational complexity, speedable and levelable sets, Degrees of Infinite Words, Polynomials and Atoms, Перспективы метаматематических структур в науке, \(\delta\)-uniform BSS machines, Arithmetic hierarchy of Abelian groups, Double jumps of minimal degrees, Isomorphism theorem for BSS recursively enumerable sets over real closed fields, Degrees joining to 0′, The density of the nonbranching degrees, Busy beaver sets and the degrees of unsolvability, Unnamed Item, On the complexity of stream equality, A recursion theoretic analysis of the clopen Ramsey theorem, The minimum degree of recursively representable choice functions
