Markov's constructive analysis; a participant's view
From MaRDI portal
Publication:1292407
DOI10.1016/S0304-3975(98)00291-6zbMath0916.68053MaRDI QIDQ1292407
Publication date: 21 June 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
complexityalgorithmconstructive mathematicscomputabilitycomputable analysisintuitionismconstructive analysis
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
A sequentially computable function that is not effectively continuous at any point ⋮ Intersection points of planar curves can be computed ⋮ A Banach-Mazur computable but not Markov computable function on the computable real numbers ⋮ DEMUTH’S PATH TO RANDOMNESS ⋮ Computable analysis with applications to dynamic systems ⋮ Computability of Subsets of Metric Spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Intuitionism. An introduction
- Constructivism in mathematics. An introduction. Volume II
- Recursive analysis
- Second Thoughts about Church's Thesis and Mathematical Proofs
- Computable functionals
- Why Gödel didn't have church's thesis
- Grundlagen der Mathematik I
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
- Nicht konstruktiv beweisbare Sätze der Analysis
This page was built for publication: Markov's constructive analysis; a participant's view
