scientific article; zbMATH DE number 4039896
From MaRDI portal
Publication:3778751
zbMATH Open0638.03058MaRDI QIDQ3778751FDOQ3778751
Publication date: 1985
Title of this publication is not available (Why is that?)
Recommendations
Other degrees and reducibilities in computability and recursion theory (03D30) Undecidability and degrees of sets of sentences (03D35) Constructive and recursive analysis (03F60)
Cited In (13)
- On the weak computability of a four dimensional orthogonal packing and time scheduling problem
- Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
- A theory of nonmonotonic rule systems I
- Title not available (Why is that?)
- Computability on subsets of Euclidean space. I: Closed and compact subsets
- On the computational complexity of best Chebyshev approximations
- COMPUTABLY COMPACT METRIC SPACES
- Index sets in computable analysis
- Computable symbolic dynamics
- Title not available (Why is that?)
- Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I
- Effective Symbolic Dynamics
- Effectively closed sets and graphs of computable real functions.
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 Q3778751)