Skip to main content
Conference Proceedings

Doing without turing machines: Constructivism and formal topology

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4497 LNCS 674-675
DOI: 10.1007/978-3-540-73001-9_71
0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We add some new insights, and thus hopefully contribute to give new impetus, to an old theme: constructive mathematics, and topology in particular, can be thought of as an abstract way to deal with computation. © Springer-Verlag Berlin Heidelberg 2007.

Author supplied keywords

Cite

CITATION STYLE

APA

Sambin, G. (2007). Doing without turing machines: Constructivism and formal topology. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4497 LNCS, pp. 674–675). https://doi.org/10.1007/978-3-540-73001-9_71

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free