Index sets as a measure of continuous constraint complexity

DOI10.1007/978-3-662-46823-4_17zbMATH Open1434.03118OpenAlexW2214365440MaRDI QIDQ3455071FDOQ3455071

Authors: Oleg Kudinov, M. V. Korovina 

Publication date: 3 December 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46823-4_17

Recommendations

• Index sets in computable analysis
• Index sets for computable differential equations
• A tutorial on computable analysis
• Computable elements and functions in effectively enumerable topological spaces
• Index sets of computable structures

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Theory of numerations, effectively presented structures (03D45) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (4)

• On higher effective descriptive set theory
• Outline of partial computability in computable topology
• Index sets for computable differential equations
• On images of partial computable functions over computable Polish spaces

This page was built for publication: Index sets as a measure of continuous constraint complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3455071)