scientific article
From MaRDI portal
Publication:3425600
zbMath1104.03001MaRDI QIDQ3425600
No author found.
Publication date: 26 February 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Related Items (20)
Effectivity questions for Kleene's recursion theorem ⋮ Splittings of effectively speedable sets and effectively levelable sets ⋮ Towards computability of elliptic boundary value problems in variational formulation ⋮ Can Newtonian systems, bounded in space, time, mass and energy compute all functions? ⋮ IN MEMORIAM: BARRY COOPER 1943–2015 ⋮ Word problems and ceers ⋮ Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces ⋮ On the main scientific achievements of Victor Selivanov ⋮ Unnamed Item ⋮ Incomputability Emergent, and Higher Type Computation ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ A class of recursive permutations which is primitive recursive complete ⋮ Embedding infinitely parallel computation in Newtonian kinematics ⋮ Definability as hypercomputational effect ⋮ Fixed-point selection functions ⋮ Theories of Rogers semilattices of analytical numberings ⋮ Turing oracle machines, online computing, and three displacements in computability theory ⋮ Uniform test of algorithmic randomness over a general space ⋮ Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions ⋮ Enumerating classes of effective quasi-Polish spaces
This page was built for publication:
