scientific article; zbMATH DE number 3117565

Cited in

(42)

Classification of computably approximable real numbers
Post's problem for ordinal register machines: an explicit approach
Turing oracle machines, online computing, and three displacements in computability theory
The density of the nonbranching degrees
Some remarks on witness functions for nonpolynomial and noncomplete sets in NP
Collapsing degrees
Not every finite lattice is embeddable in the recursively enumerable degrees
Post's problem without admissibility
Coding a family of sets
Lattice nonembeddings and intervals of the recursively enumerable degrees
Orbits of computably enumerable sets: Low sets can avoid an upper cone
The bounded injury priority method and the learnability of unions of rectangles
Call-by-value lambda calculus as a model of computation in Coq
On the Turing degrees of minimal index sets
Extension of partial recursive functions and functions with a recursive graph
On the reducibility of \(\Pi_ 1^ 1\) sets
Resource bounded immunity and simplicity
Monadic second-order logic and the domino problem on self-similar graphs
Strong and weak reducibility of algorithmic problems
Extensions of embeddings below computably enumerable degrees
The typical constructible object
Some Theorems on Classes of Recursively Enumerable Sets
Hierarchy of Computably Enumerable Degrees II
On \(n\)-tardy sets
On the cutting edge of relativization: the resource bounded injury method
THE COLLAPSE OF THE HILBERT PROGRAM: A VARIATION ON THE GÖDELIAN THEME
On unstable and unoptimal prediction
Naturalness in mathematics
As easy as \(\mathbb {Q}\): Hilbert's tenth problem for subrings of the rationals and number fields
The finite intervals of the Muchnik lattice
Metarecursively enumerable sets and admissible ordinals
A Simple Set Which is Not Effectively Simple
Recursive Enumerability and the Jump Operator
Computational processes, observers and Turing incompleteness
Extending and interpreting Post's programme
Iterated priority arguments in descriptive set theory
Kolmogorov's Calculus of Problems and its Legacy
Comparing dialectical systems: contradiction and counterexample in belief change
Undecidability and 1-types in the recursively enumerable degrees
Incomparable prime ideals of recursively enumerable degrees
Computably enumerable sets and related issues
On Lachlan's major sub-degree problem

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 Q3232283)