Skip to main content
SpringerLink
Log in

Une contribution aux theories modernes de communication: machines de Turing et problemes de mot

  • Published:
Synthese Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Bibliographie

  • A. Church, An unsolvable problem of elementary number theory, Amer. J. Math. 58 (1936), 345–363.

    Article  Google Scholar 

  • A. Gödel. Ueber formal unentscheidbare Sätze der Principia Mathematica, Monatsch. Math. Phys. 38 (1931), 173–198.

    Google Scholar 

  • J. W. Goethe, Faust I.

  • M. Hall Jr., The word problem for semi-groups with two generators; J. Symb. Logic, 14 (1949), 544–546.

    Article  Google Scholar 

  • L. Kalmar, Another Proof of the Markov-Post theorem, Acta Math. Acad. Sci. Hung. 3 (1952), 1–27.

    Article  Google Scholar 

  • S. C. Kleene, General recursive functions of natural numbers, Math.Ann. 112(1935), 727–742

    Article  Google Scholar 

  • A. A. Markov. 1. On the representation of recursive functions, Izv. AK Nauk SSSR, S. Mat. 13 (1949), 417–427 (en russe; aussi Amer. Math. Soc. Translation 54).

    Google Scholar 

  • —— —— —— 2. The impossibility of certain algorithms on the theory of associative systems, Dokl. Ak. Nauk SSSR 77 (1951), 19–20.

    Google Scholar 

  • E. L. Post, Recursive unsolvability of a problem of Thue, J. Symb. Logic, 12 (1947), 1–11.

    Article  Google Scholar 

  • P. C. Rosenbloom, The elements of mathematical logic, Dover N.Y. (1950) (en librairie; Ch. IV: the general syntax of languages; App. 2: algebraic approach to language; des notes bibliographiques commentées).

  • D. Tamari, Monoïdes préordonnés et chaînes de Malcev.

  • V. A. Tartakovski, 1–2. The sieve method in group theory, Mat. Sbornik 25 (67) (1949), 3–50, 251–274 (en russe).

    Google Scholar 

  • —— 3. Solution of the word problem for groups with k>6, Izv. Ak. Nauk SSSR, S. Mat. 13 (1949), 483–494 (en russe). 1–3 Amer. Math. Soc. Translation 60.

    Google Scholar 

  • A. M. Turing, 1. On computable numbers with an application to the Entscheidungs-problem, Proc. London Math. Soc. 42 (1937), 230–265; 2. Rectification, Proc. London Math. Soc. 43 (1937), 544–546; 3. The word problem in semi-groups with cancellation, Annals of Math. 52 (1950), 491–505.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculté des Sciences à Haifa, Israël

    Dov Tamari

Authors
  1. Dov Tamari
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tamari, D. Une contribution aux theories modernes de communication: machines de Turing et problemes de mot. Synthese 9, 205–227 (1955). https://doi.org/10.1007/BF00567407

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00567407

Search

Navigation