Markov's constructive analysis; a participant's view

DOI10.1016/S0304-3975(98)00291-6zbMath0916.68053MaRDI QIDQ1292407

Boris A. Kushner

Publication date: 21 June 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

complexity; algorithm; constructive mathematics; computability; computable analysis; intuitionism; constructive analysis

Mathematics Subject Classification ID

Related Items

Computability of Subsets of Metric Spaces, Intersection points of planar curves can be computed, Computable analysis with applications to dynamic systems, A sequentially computable function that is not effectively continuous at any point, A Banach-Mazur computable but not Markov computable function on the computable real numbers, DEMUTH’S PATH TO RANDOMNESS

Cites Work

• 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
• 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