scientific article
From MaRDI portal
Publication:4040892
zbMath0623.03042MaRDI QIDQ4040892
Publication date: 5 June 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory (03Dxx)
Related Items (only showing first 100 items - show all)
Computational depth and reducibility ⋮ Duality, non-standard elements, and dynamic properties of r.e. sets ⋮ Effectively categorical abelian groups ⋮ Effectivity questions for Kleene's recursion theorem ⋮ Initial segment complexities of randomness notions ⋮ Invertible classes ⋮ Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism ⋮ Results on memory-limited U-shaped learning ⋮ Covering the Recursive Sets ⋮ Rice’s Theorem in Effectively Enumerable Topological Spaces ⋮ Degrees containing members of thin Π10 classes are dense and co-dense ⋮ Minimal generalized computable enumerations and high degrees ⋮ On images of partial computable functions over computable Polish spaces ⋮ Boolean algebras realized by c.e. equivalence relations ⋮ Learning theory in the arithmetic hierarchy. II. ⋮ AVOIDING EFFECTIVE PACKING DIMENSION 1 BELOW ARRAY NONCOMPUTABLE C.E. DEGREES ⋮ Orders on magmas and computability theory ⋮ Computable isomorphisms for certain classes of infinite graphs ⋮ On existential definitions of c.e. subsets of rings of functions of characteristic 0 ⋮ Uniformly computably separable algebras with effectively splittable families of negative congruences ⋮ The Hilbert's-tenth-problem operator ⋮ The computational strength of matchings in countable graphs ⋮ Computability of validity and satisfiability in probability logics over finite and countable models ⋮ Unnamed Item ⋮ Rethinking revision ⋮ Minimal generalized computable numberings and families of positive preorders ⋮ Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces ⋮ Joining to High Degrees ⋮ Perfect Local Computability and Computable Simulations ⋮ Cupping Classes of $\Sigma^0_2$ Enumeration Degrees ⋮ Relativized depth ⋮ Completeness criteria for a class of reducibilities ⋮ Domatic partitions of computable graphs ⋮ Generalization of Shapiro's theorem to higher arities and noninjective notations ⋮ \(sQ_1\)-degrees of computably enumerable sets ⋮ Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions ⋮ Numberings Optimal for Learning ⋮ When Is Reachability Intrinsically Decidable? ⋮ Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees ⋮ On effectively closed sets of effective strong measure zero ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ Complexity of Ehrenfeucht models ⋮ On the cutting edge of relativization: The resource bounded injury method ⋮ Bi-immunity over different size alphabets ⋮ On the algebraic structure of Weihrauch degrees ⋮ Some properties of the upper semilattice of computable families of computably enumerable sets ⋮ Empiricism, probability, and knowledge of arithmetic: a preliminary defense ⋮ On 0′-computable reals ⋮ Trivial Reals ⋮ Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis ⋮ Things that can be made into themselves ⋮ Kolmogorov Complexity Theory over the Reals ⋮ Computability and the Implicit Function Theorem ⋮ A Cappable Almost Everywhere Dominating Computably Enumerable Degree ⋮ Medvedev Degrees of Generalized R.E. separating Classes ⋮ Selection by Recursively Enumerable Sets ⋮ A survey of results on the d.c.e. and \(n\)-c.e. degrees ⋮ C-quasi-minimal enumeration degrees below \(\mathbf c'\) ⋮ Small \(\Pi^{0}_{1}\) classes ⋮ The ibT degrees of computably enumerable sets are not dense ⋮ Effective categoricity of equivalence structures ⋮ The irrationality exponents of computable numbers ⋮ Computably enumerable Turing degrees and the meet property ⋮ An uncountably categorical theory whose only computably presentable model is saturated ⋮ On uniform relationships between combinatorial problems ⋮ Searching for shortest and least programs ⋮ On the degree structure of equivalence relations under computable reducibility ⋮ Unnamed Item ⋮ On cototality and the skip operator in the enumeration degrees ⋮ Khutoretskii's theorem for generalized computable families ⋮ On realization of index sets in \(\Pi_1^0\)-classes ⋮ Recursively enumerable sets and degrees ⋮ Measure-theoretic applications of higher Demuth’s Theorem ⋮ Investigations Concerning the Structure of Complete Sets ⋮ Undecidability in Rn: Riddled Basins, the KAM Tori, and the Stability of the Solar System ⋮ Detecting properties from descriptions of groups ⋮ Fixed point theorems for precomplete numberings ⋮ Rogers semilattices for families of equivalence relations in the Ershov hierarchy ⋮ COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS ⋮ Extensions of embeddings below computably enumerable degrees ⋮ Reductions between types of numberings ⋮ A non-splitting theorem for d.r.e. sets ⋮ On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms ⋮ Lowness properties and randomness ⋮ Completing pseudojump operators ⋮ The existence of high nonbounding degrees in the difference hierarchy ⋮ On self-embeddings of computable linear orderings ⋮ ORDINAL ANALYSIS OF PARTIAL COMBINATORY ALGEBRAS ⋮ ON SUPERSETS OF NON-LOW SETS ⋮ Cone avoidance and randomness preservation ⋮ On the Computable Theory of Bounded Analytic Functions ⋮ Enumerations of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msubsup><mml:mi mathvariant="normal">Π</mml:mi><mml:mn>1</mml:mn><mml:mn>0</mml:mn></mml:msubsup></mml:math> Classes: Acceptability and Decidable Classes ⋮ Random reals as measures of natural open sets ⋮ On \(\Delta_2^0\)-categoricity of equivalence relations ⋮ Graphs realised by r.e. equivalence relations ⋮ A reducibility related to being hyperimmune-free ⋮ Computable Complex Analysis ⋮ Integer valued betting strategies and Turing degrees ⋮ EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS ⋮ Trivial measures are not so trivial
This page was built for publication: