scientific article
From MaRDI portal
Publication:3778751
zbMath0638.03058MaRDI QIDQ3778751
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Constructive and recursive analysis (03F60) Undecidability and degrees of sets of sentences (03D35) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (11)
A theory of nonmonotonic rule systems I ⋮ On the weak computability of a four dimensional orthogonal packing and time scheduling problem ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Computable symbolic dynamics ⋮ Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis ⋮ Effective Symbolic Dynamics ⋮ On the computational complexity of best Chebyshev approximations ⋮ 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 ⋮ Effectively closed sets and graphs of computable real functions.
This page was built for publication:
