scientific article
From MaRDI portal
Publication:3232283
zbMath0070.24701MaRDI QIDQ3232283
Publication date: 1956
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (39)
Some remarks on witness functions for nonpolynomial and noncomplete sets in NP ⋮ THE COLLAPSE OF THE HILBERT PROGRAM: A VARIATION ON THE GÖDELIAN THEME ⋮ On the Turing degrees of minimal index sets ⋮ The Typical Constructible Object ⋮ Collapsing degrees ⋮ A Simple Set Which is Not Effectively Simple ⋮ The bounded injury priority method and the learnability of unions of rectangles ⋮ Computational processes, observers and Turing incompleteness ⋮ Not every finite lattice is embeddable in the recursively enumerable degrees ⋮ On unstable and unoptimal prediction ⋮ Post's problem without admissibility ⋮ Extending and interpreting Post's programme ⋮ Monadic second-order logic and the domino problem on self-similar graphs ⋮ On \(n\)-tardy sets ⋮ As easy as $\mathbb {Q}$: Hilbert’s Tenth Problem for subrings of the rationals and number fields ⋮ The finite intervals of the Muchnik lattice ⋮ On the cutting edge of relativization: The resource bounded injury method ⋮ On Lachlan's major sub-degree problem ⋮ Undecidability and 1-types in the recursively enumerable degrees ⋮ Incomparable prime ideals of recursively enumerable degrees ⋮ Computably enumerable sets and related issues ⋮ Strong and weak reducibility of algorithmic problems1 ⋮ Lattice nonembeddings and intervals of the recursively enumerable degrees ⋮ Naturalness in Mathematics ⋮ Hierarchy of Computably Enumerable Degrees II ⋮ Recursive Enumerability and the Jump Operator ⋮ Classification of computably approximable real numbers ⋮ Extension of partial recursive functions and functions with a recursive graph ⋮ On the reducibility of \(\Pi_ 1^ 1\) sets ⋮ Post's problem for ordinal register machines: an explicit approach ⋮ Turing oracle machines, online computing, and three displacements in computability theory ⋮ Call-by-value lambda calculus as a model of computation in Coq ⋮ Extensions of embeddings below computably enumerable degrees ⋮ Some Theorems on Classes of Recursively Enumerable Sets ⋮ Coding a family of sets ⋮ Orbits of computably enumerable sets: Low sets can avoid an upper cone ⋮ The density of the nonbranching degrees ⋮ Resource bounded immunity and simplicity ⋮ Metarecursively enumerable sets and admissible ordinals
This page was built for publication:
