scientific article; zbMATH DE number 3342830
From MaRDI portal
zbMath0216.00901MaRDI QIDQ5619076
Publication date: 1968
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees, Elementary theories and structural properties of d-c.e. and n-c.e. degrees, Nonlowness is independent from fickleness, Embeddability of the semilattice \(L_m^0\) in Rogers semilattices, There exists a maximal 3-c.e. enumeration degree, Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism, Rogers semilattices of families of two embedded sets in the Ershov hierarchy, Approximating approximate reasoning: fuzzy sets and the Ershov hierarchy, Bounded query classes and the difference hierarchy, The branching theorem and computable categoricity in the Ershov hierarchy, Turing reducibility in the fine hierarchy, Normalizing notations in the Ershov hierarchy, Towards characterizing the \(> \omega^2\)-fickle recursively enumerable Turing degrees, Automorphisms ofη-like computable linear orderings and Kierstead's conjecture, Fixed-parameter decidability: Extending parameterized complexity analysis, A classification of low c.e. sets and the Ershov hierarchy, Fine hierarchies via Priestley duality, Structures of the degrees of unsolvability of index sets, Classifying equivalence relations in the Ershov hierarchy, A Survey of Results on the d-c.e. and n-c.e. Degrees, Nondensity of Double Bubbles in the D.C.E. Degrees, Decomposability of low 2-computably enumerable degrees and Turing jumps in the Ershov hierarchy, Characterizing the strongly jump-traceable sets via randomness, The Boolean hierarchy of NP-partitions, On the number of infinite sequences with trivial initial segment complexity, On universal pairs in the Ershov hierarchy, Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees, A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES, Fine hierarchies and m-reducibilities in theoretical computer science, Degree Spectra of Relations on a Cone, Infima in the d.r.e. degrees, Computable categoricity and the Ershov hierarchy, Turing degrees in refinements of the arithmetical hierarchy, Turing jumps in the Ershov hierarchy, Strongly \(\eta \)-representable degrees and limitwise monotonic functions, Positive undecidable numberings in the Ershov hierarchy, Friedberg numberings in the Ershov hierarchy, A survey of results on the d.c.e. and \(n\)-c.e. degrees, On computable enumerations. I, The limitations of cupping in the local structure of the enumeration degrees, Completeness in the arithmetical hierarchy and fixed points, Function operators spanning the arithmetical and the polynomial hierarchy, Convex subsets of \(2^n\) and bounded truth-table reducibility, Turing computability: structural theory, Precomplete numberings, Resource restricted computability theoretic learning: Illustrative topics and problems, Relative enumerability in Ershov's hierarchy, Analogues of Rice's theorem for semantic classes of propositions, Model-theoretic properties of Turing degrees in the Ershov difference hierarchy, Hierarchy of Computably Enumerable Degrees II, Weakly precomplete equivalence relations in the Ershov hierarchy, Classification of computably approximable real numbers, On index sets, Rice and Rice-Shapiro Theorems for transfinite correction grammars, On a hierarchy of sets. III, Reductions between types of numberings, On the finiteness of the recursive chromatic number, On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms, Maximality and collapse in the hierarchy of α-c.a. degrees, Families without minimal numberings, Multiple m-reducibility of index sets, Computability of Real Numbers, Unifying logic, topology and learning in parametric logic, Mathematics based on incremental learning -- excluded middle and inductive inference
