Skip to main content Accessibility help
×
Hostname: page-component-7c8c6479df-24hb2 Total loading time: 0 Render date: 2024-03-29T11:01:11.421Z Has data issue: false hasContentIssue false

K-graph Machines: generalizing Turing's machines and arguments

from Part I - Invited Papers

Published online by Cambridge University Press:  23 March 2017

Wilfried Sieg
Affiliation:
Department of Philosophy
John Byrnes
Affiliation:
Department of Philosophy
Petr Hájek
Affiliation:
Academy of Sciences of the Czech Republic, Prague
Get access

Summary

Summary. The notion of mechanical process has played a crucial role in mathematical logic since the early thirties; it has become central in computer science, artificial intelligence, and cognitive psychology. But the discussion of Church's Thesis, which identifies the informal concept with a mathematically precise one, has hardly progressed beyond the pioneering work of Church, Gödel, Post, and Turing. Turing addressed directly the question: What are the possible mechanical processes a human computor can carry out in calculating values of a number-theoretic Junction? He claimed that all such processes can be simulated by machines, in modern terms, by deterministic Turing machines. Turing's considerations for this claim involved, first, a formulation of boundedness and locality conditions (for linear symbolic configurations and mechanical operations); second, a proof that computational processes (satisfying these conditions) can be carried out by Turing machines; third, the central thesis that all mechanical processes carried out by human computors must satisfy the conditions. In Turing's presentation these three aspects are intertwined and important steps in the proof are only hinted at. We introduce Kgraph machines and use them to give a detailed mathematical explication of the first two aspects of Turing's considerations for general configurations, i.e. K-graphs. This generalization of machines and theorems provides, in our view, a significant strengthening of Turing's argument for his central thesis.

Introduction

Turing's analysis of effective calculability is a paradigm of a foundational study that (i) led from an informally understood concept to a mathematically precise notion, (ii) offered a detailed investigation of the new mathematical notion, and (iii) settled an important open question, namely the Entscheidungsproblem. The special character of Turing's analysis was recognized immediately by Church in his review of Turing's 1936 paper. The review was published in the first issue of the 1937 volume of the Journal of Symbolic Logic, and Church contrasted in it Turing's mathematical notion for effective calculability (via idealized machines) with his own (via definability) and Gödel's general recursiveness and asserted: “Of these, the first has the advantage of making the identification with effectiveness in the ordinary (not explicitly defined) sense evident immediately….”

Type
Chapter
Information
Gödel '96
Logical Foundations of Mathematics, Computer Science and Physics - Kurt Gödel's Legacy
, pp. 98 - 119
Publisher: Cambridge University Press
Print publication year: 2017

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Ajtai, M.. The complexity of the pigeonhole principle, in: Proceedings of the 29th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, Piscataway, New Jersey, 1988, pp. 346–355.
Beame, P., Impagliazzo, R., Krajíček, J., Pitassi, T. and Pudlák, P.. Lower bounds on Hilbert's Nullstellensatz and prepositional proofs, Proc. London Math. Soc., to appear.
Buss, S. R.. Bounded Arithmetic, Bibliopolis 1986, Napoli. Revision of 1985 Princeton University Ph.D. thesis.
Buss, S. R.. Relating the bounded arithmetic and polynomial time hierarchies, Annals of Pure and Applied Logic 75 (1995), pp. 67–77.Google Scholar
Buss, S. R.. First order proof theory of arithmetic, in Handbook of Proof Theory, Buss, S. R. ed., North Holland, to appear.
Cook, S. A.. Feasibly constructive proofs and the propositional calculus, in: Proceedings of the Seventh Annual ACM Symposium on the Theory of Computing, Association for Computing Machinery 1975, New York, pp. 83–97.
Cook, S. A. and Reckhow, R. A.. The relative efficiency of propositional proof systems, Journal of Symbolic Logic 44, (1979) pp. 36–50.Google Scholar
Dowd, M.. Propositional Representation of Arithmetic Proofs, PhD thesis, University of Toronto 1979.
Van den Dries, . Which curves over Z have points with coordinates in a discretely ordered ring? Transactions AMS 264 (1990) pp. 33–56.Google Scholar
Ferreira, F.. Binary models generated by their tally part, Archive for Math. Logic, to appear.
Hájek, P. and Pudlák, P.. Metamathematics of First-order Arithmetic, Springer-Verlag 1993, Berlin.
Haken, A.. The intractability of resolution, Theoretical Computer Science, 39, (1985) pp. 297–308.Google Scholar
Krajíček, J.. Lower bounds to the size of constant-depth propositional proofs, Journal of Symbolic Logic, 59, (1994) pp. 73–86.Google Scholar
Krajíček, J.. On Frege and extended Frege proof systems, in: Feasible Mathematics II, Krajíček, J. and Remmel, J., eds., Birkhäuser, Boston, 1994, pp. 284–319.
Krajíček, J.. Bounded Arithmetic, Propositional Logic and Complexity Theory, Cambridge University Press 1995.
Krajíček, J.. Extensions of models of PV, manuscript, 1996.
Krajíček, J. and Pudlák, P.. Propositional proof systems, the consistency of first-order theories and the complexity of computations, Journal of Symbolic Logic, 54, (1989) pp. 1063–1079.Google Scholar
Krajíček, J. and Pudlák, P.. Quantified prepositional calculi and fragments of bounded arithmetic, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 36, pp. 29–46.
Krajíček, J. and Pudlák, P.. Propositional provability in models of weak arithmetic, in: Computer Science Logic'89, Boerger, E. et al. eds., Springer-Verlag LNCS 440, (1990), pp. 193–210.
Krajíček, J., Pudlák, P. and Takeuti, G.. Bounded arithmetic and the polynomial hierarchy, Annals of Pure and Applied Logic 52, (1991) pp. 143–153.Google Scholar
Krajíček, J., Pudlák, P., and Woods, A.. An exponential lower bound to the size of bounded depth Frege proofs of the pigeonhole principle, Random structures and Algorithms 7/1 (1995), pp. 15–39.Google Scholar
Kreisel, G.. Mathematical significance of consistency proofs. Journal of Symbolic Logic, 23 (1958), pp. 155–182.Google Scholar
Marker, D. and Macintyre, A.. Primes and their residue rings in models of open induction, Annals of Pure and Applied Logic 43, (1989) pp. 57–77.Google Scholar
Matiyasevich, Yu.. The Riemann hypothesis from a logician's point of view. Proc. First Conference of the Canadian Number Theory Association, Ed. Mollin, R.. Walter de Gruyter, 1990, pp. 387–400.
McAloon, K.. On the complexity of models of arithmetic, Journal of Symbolic Logic 47, (1982), pp. 403–415.Google Scholar
Otero, M.. Quadratic forms in normal open induction, Journal of Symbolic Logic, to appear.
Parikh, R.. Existence and feasibility in arithmetic, Journal of Symbolic Logic, 36, (1971) pp. 494–508.Google Scholar
Paris, J. B. and Harrington, L.. A mathematical incompleteness in Peano arithmetic, in: Handbook of Mathematical Logic North-Holland 1977, pp. 1133–1142.
Paris, J. B. and Wilkie, A. J.. Counting problems in bounded arithmetic, in: Methods in Mathematical Logic, Proceedings of the 6-th Latin American Symposium, Caracas, Venezuella, Di Prisco, C. A., ed., Lecture Notes in Mathematics #1130, Springer-Verlag, Berlin, 1985 pp. 317–340.
Paris, J. B. and Wilkie, A. J.. ∆0 sets and induction, in: Proc. of the Jadwisin Logic Conf., Poland, Leeds Univ. Press, pp. 237–248.
Pitassi, T., Beame, P., and Impagliazzo, R.. Exponential lower bounds for the pigeonhole principle, Computational Complexity, 3, (1993) pp. 97–140.Google Scholar
Pudlák, P.. Lower bounds for resolution and cutting planes proofs and monotone computations, Journal of Symbolic Logic, to appear.
Pudlák, P.. Improved Bounds to the Lengths of Proofs of Finitistic Consistency Statements, in Logic and Combinatorics, Simpson, S. J. editor, Contemporary Mathematic 65, American Mathematical Society 1987, pp. 309–331.
Pudlák, P.. The lengths of proofs, in Handbook of Proof Theory, Buss, S. R. ed., North Holland, to appear.
Riis, S.. Making infinite structures finite in models of second order bounded arithmetic, in: Arithmetic, Proof Theory and Computational Complexity, Clote, P. and Krajíček, J. eds., Oxford Univ. Press 1993, pp. 289–319.
Shepherdson, J.C.. A non-standard model of a free variable fragment of number theory, Bull. Acad. Pol. Sci., 12, (1964) pp. 79–86.Google Scholar
Takeuti, G. and Yasumoto, M.. Forcing on bounded arithmetic, this procceedings.
Wilkie, A. A.. Some results and problems on weak systems of arithmetic, in Macintyre, A. et al eds., Logic Colloquium'77, North-Holland 1978, pp. 285–296.
Wilkie, A. A.. On sentences interpret able in systems of arithmetic, in: Logic Colloquium'84, North-Holland 1986, pp. 329–342.
Wilkie, A. A.. A model-theoretic proof of Buss's characterization of the polynomial time computable function, manuscript, 1985.
Wilkie, A. A. and Paris, J. B.. On the schema of induction for bounded arithmetical formulas, Annals of Pure and Applied Logic 35, (1987) pp. 261–302.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×