Real Hypercomputation and Continuity

Martin Ziegler

Type: Article

Publication Date: 2007-05-04

Citations: 37

DOI: https://doi.org/10.1007/s00224-006-1343-6

Similar Works

Action	Title	Year	Authors
+	The Myth of Hypercomputation	2004	Martin Davis
+	Realcompactness	2003	John J. Schommer
+	Real Algebra	1998	Jacek Bochnak Michel Coste Marie-Françoise Roy
+	Real Algebra	1996	Carlos Andradas Ludwig Bröcker Jesús M. Ruíz
+	Noël Gastinel and computational Mathematics	1986	Jean Della Dora François Robert
+	Hypercomputation: philosophical issues	2004	B. Jack Copeland
+	A Brief Critique of Pure Hypercomputation	2009	Paolo Cotogno
+	Real maths!	2021	Linda Pound Trisha Lee
+	Some thoughts on hypercomputation	2005	Newton C. A. da Costa Francisco Antônio Dória
+	Reality, Mathematics, and Computation	2004	Ivan Hlaváěek Jan Chleboun Ivo Babuška
+	A characterization of realcompactness	1996	John J. Schommer
+	Bitopological realcompactness	2005	J. Aarts Mila Mršević
+	Computational Prospects of Infinity	2008	C. T. Chong Feng Qi Theodore A. Slaman W. Hugh Woodin Yue Yang
+ PDF Chat	Computational Prospects of Infinity	2008	C. T. Chong Feng Qi Theodore A. Slaman W. Hugh Woodin Yue Yang
+	Real Measure	2022
+	Real Measure	2017	Mehmet Tabak
+	Mysteries of mathematics and computation	1994	Michael Shub
+	Why there is no such discipline as hypercomputation	2005	Martin Davis
+ PDF Chat	Zeno machines and hypercomputation	2006	Petrus H. Potgieter
+ PDF Chat	Painless mathematics	1996	R Macleod

Action	Title	Year	Authors
+ PDF Chat	Closed choice and a Uniform Low Basis Theorem	2012	Vasco Brattka Matthew de Brecht Arno Pauly
+ PDF Chat	Probabilistic computability and choice	2015	Vasco Brattka Guido Gherardi Rupert Hölzl
+	Inside the Muchnik degrees I: Discontinuity, learnability and constructivism	2014	Kosuke Higuchi Takayuki Kihara
+ PDF Chat	The degree structure of Weihrauch-reducibility	2013	Kojiro Higuchi Arno Pauly
+	Revising Type-2 Computation and Degrees of Discontinuity	2007	Martin Ziegler
+ PDF Chat	Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract)	2015	Arno Pauly
+ PDF Chat	Finite choice, convex choice and finding roots	2015	Stéphane Le Roux Arno Pauly
+	Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability	2008	Martin Ziegler
+ PDF Chat	On the topological aspects of the theory of represented spaces	2016	Arno Pauly
+ PDF Chat	A comparison of concepts from computable analysis and effective descriptive set theory	2016	Vassilios Gregoriades TAMÁS KISPÉTER Arno Pauly

Action	Title	Year	Authors
+	The Arithmetical Hierarchy of Real Numbers	2001	Xizhong Zheng Klaus Weihrauch
+	Computability theory of generalized functions	2003	Ning Zhong Klaus Weihrauch
+	Algorithmic complexity of recursive and inductive algorithms	2004	Mark Burgin
+	A transfinite hierarchy of reals	2003	George Barmpalias
+	Equality is a jump	1999	Paolo Boldi Sebastiano Vigna