scientific article

zbMATH Open0623.03042MaRDI QIDQ4040892FDOQ4040892

Robert I. Soare

Publication date: 5 June 1993

Title of this publication is not available (Why is that?)

Recommendations

• scientific article
• scientific article
• Classical recursion theory. Vol. II
• Techniques of admissible recursion theory
• Classical recursion theory. The theory of functions and sets of natural numbers

zbMATH Keywords

priorityrecursively enumerable setsdegreesinjury

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursively (computably) enumerable sets and degrees (03D25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Computability and recursion theory (03Dxx)

Cited In (only showing first 100 items - show all)

• A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees
• Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
• Undecidability and 1-types in intervals of the computably enumerable degrees
• Any FIP real computes a 1-generic
• Noisy inference and oracles
• Lawvere-Tierney topologies for computability theorists
• On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms
• Classes bounded by incomplete sets
• Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
• Relativized depth
• A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE
• A specification structure for deadlock-freedom of synchronous processes
• Positive presentations of families relative to \(e\)-oracles
• On unstable and unoptimal prediction
• Universal generalized computable numberings and hyperimmunity
• Relatively recursive reals and real functions
• Complementing cappable degrees in the difference hierarchy.
• The closure properties on real numbers under limits and computable operators.
• Nonisolated degrees and the jump operator
• On algebraic and logical specifications of classes of regular languages.
• Definable properties of the computably enumerable sets
• Minimal generalized computable enumerations and high degrees
• A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees
• Turing degrees of hypersimple relations on computable structures
• On cototality and the skip operator in the enumeration degrees
• On the cutting edge of relativization: The resource bounded injury method
• COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS
• Quasi-injective reductions
• Lowness and logical depth
• A rank one cohesive set
• The polynomially exponential time restrained analytical hierarchy
• Computational depth and reducibility
• COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR
• Completeness criteria for a class of reducibilities
• Schnorr randomness for noncomputable measures
• Typing total recursive functions in Coq
• Computability of validity and satisfiability in probability logics over finite and countable models
• Connected choice and the Brouwer fixed point theorem
• Jumps of computably enumerable equivalence relations
• Boolean pairs formed by the \(\Delta_ n^ 0\)-sets
• Point Degree Spectra of Represented Spaces
• On the algebraic structure of Weihrauch degrees
• Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
• Title not available (Why is that?)
• Resolution of Hartmanis' conjecture for NL-hard sparse sets
• Interpreting \(\mathbb{N}\) in the computably enumerable weak truth table degrees
• Recursion-theoretic ranking and compression
• Computable categoricity for algebraic fields with splitting algorithms
• INITIAL SEGMENTS OF THE DEGREES OF CEERS
• The theory of ceers computes true arithmetic
• Computing sets from all infinite subsets
• Deciding the Vapnik-Červonenkis dimension is \(\Sigma_3^p\)-complete
• Small \(\Pi^{0}_{1}\) classes
• Honest polynomial time reducibilities and the \(P=?NP\) problem
• Irreducible, singular, and contiguous degrees
• Generic degrees are complemented
• Undecidability and 1-types in the recursively enumerable degrees
• Index sets for \(\Pi^0_1\) classes
• The ibT degrees of computably enumerable sets are not dense
• On \(\Pi_ 2\) theories of \(hp-T\) degrees of low sets
• A semilattice of numberings. II
• A non-inversion theorem for the jump operator
• \(sQ_1\)-degrees of computably enumerable sets
• Computable presentability of countable linear orders
• Limit computability and ultrafilters
• Computably enumerable Turing degrees and the meet property
• Decidable Kripke models of intuitionistic theories
• Lower bounds and the hardness of counting properties
• Dependence relations in computably rigid computable vector spaces
• Countable thin \(\Pi^0_1\) classes
• Coding in the partial order of enumerable sets
• On the classification of computable languages
• The recursively enumerable degrees have infinitely many one-types
• There is no fat orbit
• The weak density of properly d-r. e. branching degree in the d-r. e. degrees
• Turing degrees in refinements of the arithmetical hierarchy
• Covering the Recursive Sets
• A uniform version of non-\(\mathrm{low}_{2}\)-ness
• Input-dependence in function-learning
• Learning all subfunctions of a function
• Classes with easily learnable subclasses
• Atomless \(r\)-maximal sets
• Fixed-point selection functions
• A class of reversible primitive recursive functions
• Undecidability in Rⁿ: Riddled Basins, the KAM Tori, and the Stability of the Solar System
• The irrationality exponents of computable numbers
• Computability and the Implicit Function Theorem
• Computational processes, observers and Turing incompleteness
• Embeddings of \(N_5\) and the contiguous degrees
• Descriptive properties on admissible sets
• Non-bounding constructions
• Lattice nonembeddings and initial segments of the recursively enumerable degrees
• Turing degrees of reals of positive effective packing dimension
• Degree spectra of the successor relation of computable linear orderings
• Martin's axiom and embeddings of upper semi-lattices into the Turing degrees
• The computable Lipschitz degrees of computably enumerable sets are not dense
• Maximal pairs of c.e. reals in the computably Lipschitz degrees
• Effective domination and the bounded jump
• Incomparable prime ideals of recursively enumerable degrees
• On relative randomness

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4040892)