Z. A. Melzak. An informal arithmetical approach to computability and computation. Canadian mathematical bulletin , vol. 4 , pp. 279–293. - Joachim Lambek. How to program an infinite abacus. Canadian mathematical bulletin , vol. 4 , pp. 295–302 [Book Review]

Journal of Symbolic Logic 31 (3):514-514 (1966)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Full Satisfaction Classes and Recursive Saturation.Alistair H. Lachlan - 1981 - Canadian Mathematical Bulletin 24 (1):295--97.
Mathematical fuzzy logics.Siegfried Gottwald - 2008 - Bulletin of Symbolic Logic 14 (2):210-239.
Concrete Digital Computation: What Does it Take for a Physical System to Compute? [REVIEW]Nir Fresco - 2011 - Journal of Logic, Language and Information 20 (4):513-537.
Mathematical arguments in context.Jean Paul Van Bendegem & Bart Van Kerkhove - 2009 - Foundations of Science 14 (1-2):45-57.
Computation in cognitive science: it is not all about Turing-equivalent computation.Kenneth Aizawa - 2010 - Studies in History and Philosophy of Science Part A 41 (3):227-236.
El Infinito Matematico.Cañón Loyes Camino - 2017 - Revista Portuguesa de Filosofia 73 (3-4):1295-1318.

Analytics

Added to PP
2014-04-01

Downloads
18 (#781,713)

6 months
5 (#526,961)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references