Publication:3778751
From MaRDI portal
zbMath0638.03058MaRDI QIDQ3778751
Publication date: 1985
03F60: Constructive and recursive analysis
03D35: Undecidability and degrees of sets of sentences
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis, Effective Symbolic Dynamics, On the weak computability of a four dimensional orthogonal packing and time scheduling problem, Computability on subsets of Euclidean space. I: Closed and compact subsets, Index sets in computable analysis, Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I, A theory of nonmonotonic rule systems I, Effectively closed sets and graphs of computable real functions., On the computational complexity of best Chebyshev approximations, Computable symbolic dynamics