Skip to main content
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 93
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Efimchik, Evgeniy A. Cherepovskaya, Elena N. and Lyamin, Andrey V. 2016. Smart Education and e-Learning 2016.

    Schroeder, Marcin 2016. Invariance as a Tool for Ontology of Information. Information, Vol. 7, Issue. 1, p. 11.

    Zawidzki, Machi 2016. Discrete Optimization in Architecture.

    Bringsjord, Selmer 2015. A Vindication of Program Verification. History and Philosophy of Logic, Vol. 36, Issue. 3, p. 262.

    De Mol, Liesbeth and Primiero, Giuseppe 2015. When Logic Meets Engineering: Introduction to Logical Issues in the History and Philosophy of Computer Science. History and Philosophy of Logic, Vol. 36, Issue. 3, p. 195.

    Schmidhuber, Jürgen 2015. Deep learning in neural networks: An overview. Neural Networks, Vol. 61, p. 85.

    BECERRA-BONACHE, Leonor and JIMÉNEZ LÓPEZ, M. Dolores 2014. Linguistic Models at the Crossroads of Agents, Learning and Formal Languages. ADCAIJ: ADVANCES IN DISTRIBUTED COMPUTING AND ARTIFICIAL INTELLIGENCE JOURNAL, Vol. 3, Issue. 4, p. 67.

    Jacquette, Dale 2014. Computable Diagonalizations and Turing’s Cardinality Paradox. Journal for General Philosophy of Science, Vol. 45, Issue. 2, p. 239.

    Nunes de Castro, Leandro Xavier, Rafael Silveira Pasti, Rodrigo Maia, Renato Dourado Szabo, Alexandre and Ferrari, Daniel Gomes 2014. Natural Computing for Simulation and Knowledge Discovery.

    Schonbein, Whit 2014. Varieties of Analog and Digital Representation. Minds and Machines, Vol. 24, Issue. 4, p. 415.

    Cooper, S. Barry and Leeuwen, Jan Van 2013. Alan Turing: His Work and Impact.

    Cooper, S. Barry and Leeuwen, Jan Van 2013. Alan Turing: His Work and Impact.

    Cooper, S. Barry and Leeuwen, Jan Van 2013. Alan Turing: His Work and Impact.

    Dershowitz, Nachum and Dowek, Gilles 2013. Universality in two dimensions. Journal of Logic and Computation, p. ext022.

    Sergeyev, Yaroslav D. and Garro, Alfredo 2013. Single-tape and multi-tape Turing machines through the lens of the Grossone methodology. The Journal of Supercomputing, Vol. 65, Issue. 2, p. 645.

    Jantke, Klaus P. Fujima, Jun Arnold, Oksana and Schulz, Andre 2012. 2012 IEEE International Conference on Multimedia and Expo Workshops. p. 260.

    Schöning, Uwe and Thomas, Wolfgang 2012. Turings Arbeiten über Berechenbarkeit – eine Einführung und Lesehilfe. Informatik-Spektrum, Vol. 35, Issue. 4, p. 253.

    Soare, R. I. 2012. Formalism and intuition in computability. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, Vol. 370, Issue. 1971, p. 3277.

    2012. Systematics.

    2012. Theory of Computation.


Finite combinatory processes—formulation1

  • Emil L. Post (a1)
  • DOI:
  • Published online: 01 March 2014

The present formulation should prove significant in the development of symbolic logic along the lines of Gödel's theorem on the incompleteness of symbolic logics and Church's results concerning absolutely unsolvable problems.

We have in mind a general problem consisting of a class of specific problems. A solution of the general problem will then be one which furnishes an answer to each specific problem.

In the following formulation of such a solution two concepts are involved: that of a symbol space in which the work leading from problem to answer is to be carried out, and a fixed unalterable set of directions which will both direct operations in the symbol space and determine the order in which those directions are to be applied.

In the present formulation the symbol space is to consist of a two way infinite sequence of spaces or boxes, i.e., ordinally similar to the series of integers …, − 3, − 2, − 1, 0, 1, 2, 3, …. The problem solver or worker is to move and work in this symbol space, being capable of being in, and operating in but one box at a time. And apart from the presence of the worker, a box is to admit of but two possible conditions, i.e., being empty or unmarked, and having a single mark in it, say a vertical stroke.

Hide All

Kurt Gödel, Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I, Monatshefte für Mathematik und Physik, vol. 38 (1931), pp. 173–198.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

Alonzo Church , An unsolvable problem of elementary number theory, American Journal of Mathematics, vol. 58 (1936), pp. 345363

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *