K-Graph Machines: Generalizing Turing's Machines and Arguments

Abstract

Wilfred Sieg and John Byrnes. K-Graph Machines: Generalizing Turing's Machines and Arguments

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 86,273

External links

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

Through your library

  • Only published works are available at libraries.

Analytics

Added to PP
2010-09-14

Downloads
66 (#210,317)

6 months
1 (#865,432)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Wilfried Sieg
Carnegie Mellon University

Citations of this work

Computing mechanisms.Gualtiero Piccinini - 2007 - Philosophy of Science 74 (4):501-526.
Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
Alan Turing and the mathematical objection.Gualtiero Piccinini - 2003 - Minds and Machines 13 (1):23-48.
Gödel’s Philosophical Challenge.Wilfried Sieg - 2020 - Studia Semiotyczne 34 (1):57-80.
Why Do We Need a Theory of Implementation?André Curtis-Trudel - 2022 - British Journal for the Philosophy of Science 73 (4):1067-1091.

View all 10 citations / Add more citations

References found in this work

No references found.

Add more references