Closed Choice for Finite and for Convex Sets
From MaRDI portal
Publication:5326378
DOI10.1007/978-3-642-39053-1_34zbMath1433.03151OpenAlexW179043391MaRDI QIDQ5326378
Publication date: 5 August 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://cronfa.swan.ac.uk/Record/cronfa37382/Download/0037382-14122017165040.pdf
Constructive and recursive analysis (03F60) Other degrees and reducibilities in computability and recursion theory (03D30) Computation over the reals, computable analysis (03D78)
Related Items
Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism, Unnamed Item, Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions, Probabilistic computability and choice