Towards computability of higher type continuous data
From MaRDI portal
Recommendations
Cited in
(12)- Outline of partial computability in computable topology
- On higher effective descriptive set theory
- On images of partial computable functions over computable Polish spaces
- Rice's theorem in effectively enumerable topological spaces
- Computability of continuous solutions of higher-type equations
- The Uniformity Principle for -definability
- Formalisation of computability of operators and real-valued functionals via domain theory
- Computable elements and functions in effectively enumerable topological spaces
- Semantic characterisations of second-order computability over the real numbers
- The Uniformity Principle for Σ-Definability with Applications to Computable Analysis
- Positive predicate structures for continuous data
- Recent advances in -definability over continuous data types
This page was built for publication: Towards computability of higher type continuous data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717046)