scientific article

From MaRDI portal
Revision as of 03:13, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4040892

zbMath0623.03042MaRDI QIDQ4040892

Robert I. Soare

Publication date: 5 June 1993


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (only showing first 100 items - show all)

Computational depth and reducibilityDuality, non-standard elements, and dynamic properties of r.e. setsEffectively categorical abelian groupsEffectivity questions for Kleene's recursion theoremInitial segment complexities of randomness notionsInvertible classesInside the Muchnik degrees. I: Discontinuity, learnability and constructivismResults on memory-limited U-shaped learningCovering the Recursive SetsRice’s Theorem in Effectively Enumerable Topological SpacesDegrees containing members of thin Π10 classes are dense and co-denseMinimal generalized computable enumerations and high degreesOn images of partial computable functions over computable Polish spacesBoolean algebras realized by c.e. equivalence relationsLearning theory in the arithmetic hierarchy. II.AVOIDING EFFECTIVE PACKING DIMENSION 1 BELOW ARRAY NONCOMPUTABLE C.E. DEGREESOrders on magmas and computability theoryComputable isomorphisms for certain classes of infinite graphsOn existential definitions of c.e. subsets of rings of functions of characteristic 0Uniformly computably separable algebras with effectively splittable families of negative congruencesThe Hilbert's-tenth-problem operatorThe computational strength of matchings in countable graphsComputability of validity and satisfiability in probability logics over finite and countable modelsUnnamed ItemRethinking revisionMinimal generalized computable numberings and families of positive preordersDescriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spacesJoining to High DegreesPerfect Local Computability and Computable SimulationsCupping Classes of $\Sigma^0_2$ Enumeration DegreesRelativized depthCompleteness criteria for a class of reducibilitiesDomatic partitions of computable graphsGeneralization of Shapiro's theorem to higher arities and noninjective notations\(sQ_1\)-degrees of computably enumerable setsInside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functionsNumberings Optimal for LearningWhen Is Reachability Intrinsically Decidable?Avoiding uniformity in the \(\Delta_2^0\) enumeration degreesOn effectively closed sets of effective strong measure zeroWell-Quasi Orders and Hierarchy TheoryComplexity of Ehrenfeucht modelsOn the cutting edge of relativization: The resource bounded injury methodBi-immunity over different size alphabetsOn the algebraic structure of Weihrauch degreesSome properties of the upper semilattice of computable families of computably enumerable setsEmpiricism, probability, and knowledge of arithmetic: a preliminary defenseOn 0′-computable realsTrivial RealsRecursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive AnalysisThings that can be made into themselvesKolmogorov Complexity Theory over the RealsComputability and the Implicit Function TheoremA Cappable Almost Everywhere Dominating Computably Enumerable DegreeMedvedev Degrees of Generalized R.E. separating ClassesSelection by Recursively Enumerable SetsA survey of results on the d.c.e. and \(n\)-c.e. degreesC-quasi-minimal enumeration degrees below \(\mathbf c'\)Small \(\Pi^{0}_{1}\) classesThe ibT degrees of computably enumerable sets are not denseEffective categoricity of equivalence structuresThe irrationality exponents of computable numbersComputably enumerable Turing degrees and the meet propertyAn uncountably categorical theory whose only computably presentable model is saturatedOn uniform relationships between combinatorial problemsSearching for shortest and least programsOn the degree structure of equivalence relations under computable reducibilityUnnamed ItemOn cototality and the skip operator in the enumeration degreesKhutoretskii's theorem for generalized computable familiesOn realization of index sets in \(\Pi_1^0\)-classesRecursively enumerable sets and degreesMeasure-theoretic applications of higher Demuth’s TheoremInvestigations Concerning the Structure of Complete SetsUndecidability in Rn: Riddled Basins, the KAM Tori, and the Stability of the Solar SystemDetecting properties from descriptions of groupsFixed point theorems for precomplete numberingsRogers semilattices for families of equivalence relations in the Ershov hierarchyCOMPUTABILITY IN PARTIAL COMBINATORY ALGEBRASExtensions of embeddings below computably enumerable degreesReductions between types of numberingsA non-splitting theorem for d.r.e. setsOn learning to coordinate: random bits help, insightful normal forms, and competency isomorphismsLowness properties and randomnessCompleting pseudojump operatorsThe existence of high nonbounding degrees in the difference hierarchyOn self-embeddings of computable linear orderingsORDINAL ANALYSIS OF PARTIAL COMBINATORY ALGEBRASON SUPERSETS OF NON-LOW SETSCone avoidance and randomness preservationOn the Computable Theory of Bounded Analytic FunctionsEnumerations 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 ClassesRandom reals as measures of natural open setsOn \(\Delta_2^0\)-categoricity of equivalence relationsGraphs realised by r.e. equivalence relationsA reducibility related to being hyperimmune-freeComputable Complex AnalysisInteger valued betting strategies and Turing degreesEFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONSTrivial measures are not so trivial







This page was built for publication: