Discrete transfinite computation models

In S. B. Cooper & Andrea Sorbi (eds.), Computability in Context: Computation and Logic in the Real World. World Scientific. pp. 375--414 (2011)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

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

My notes

Similar books and articles

Continuous formal systems: A unifying model in language and cognition.Bruce J. MacLennan - unknown
A Note on the Physical Possibility of Transfinite Computation.Wayne Aitken & Jeffrey A. Barrett - 2010 - British Journal for the Philosophy of Science 61 (4):867-874.
Grounding analog computers.Bruce J. MacLennan - unknown
The instructional information processing account of digital computation.Nir Fresco & Marty J. Wolf - 2014 - Synthese 191 (7):1469-1492.
Toward a synthesis of dynamical systems and classical computation.Frank van der Velde & Marc de Kamps - 1998 - Behavioral and Brain Sciences 21 (5):652-653.
On the physical possibility of ordinal computation (draft).Jeffrey A. Barrett & Wayne Aitken - unknown
Significance of Models of Computation, from Turing Model to Natural Computation.Gordana Dodig-Crnkovic - 2011 - Minds and Machines 21 (2):301-322.
Transcending Turing computability.B. J. Maclennan - 2003 - Minds and Machines 13 (1):3-22.
On implementing a computation.David J. Chalmers - 1994 - Minds and Machines 4 (4):391-402.
Statistical models as cognitive models of individual differences in reasoning.Andrew J. B. Fugard & Keith Stenning - 2013 - Argument and Computation 4 (1):89 - 102.
Hierarchical Bayesian models as formal models of causal reasoning.York Hagmayer & Ralf Mayrhofer - 2013 - Argument and Computation 4 (1):36 - 45.
Neural Computation and the Computational Theory of Cognition.Gualtiero Piccinini & Sonya Bahar - 2013 - Cognitive Science 37 (3):453-488.
Abstract State Machines: a unifying view of models of computation and of system design frameworks.Egon Börger - 2005 - Annals of Pure and Applied Logic 133 (1-3):149-171.
Limit spaces and transfinite types.Dag Normann & Geir Waagb - 2002 - Archive for Mathematical Logic 41 (6):525-539.

Analytics

Added to PP
2014-01-26

Downloads
19 (#750,145)

6 months
4 (#678,769)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The computational strengths of α-tape infinite time Turing machines.Benjamin Rin - 2014 - Annals of Pure and Applied Logic 165 (9):1501-1511.
A Note on the Physical Possibility of Transfinite Computation.Wayne Aitken & Jeffrey A. Barrett - 2010 - British Journal for the Philosophy of Science 61 (4):867-874.

Add more citations

References found in this work

Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.
Recursion-theoretic hierarchies.Peter G. Hinman - 1978 - New York: Springer Verlag.
Admissible Sets and Structures.Jon Barwise - 1978 - Studia Logica 37 (3):297-299.
Tasks and Supertasks.James Thomson - 1954 - Analysis 15 (1):1--13.

View all 27 references / Add more references