Skip to Main Content

Bulletin of the American Mathematical Society

The Bulletin publishes expository articles on contemporary mathematical research, written in a way that gives insight to mathematicians who may not be experts in the particular topic. The Bulletin also publishes reviews of selected books in mathematics and short articles in the Mathematical Perspectives section, both by invitation only.

ISSN 1088-9485 (online) ISSN 0273-0979 (print)

The 2020 MCQ for Bulletin of the American Mathematical Society is 0.84.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Book Review

The AMS does not provide abstracts of book reviews. You may download the entire review from the links below.


MathSciNet review: 1566598
Full text of review: PDF   This review is available free of charge.
Book Information:

Authors: Samuel Eilenberg and Calvin C. Elgot
Title: Recursiveness
Additional book information: Academic Press, New York and London, 1970. vii+89 pp.

References [Enhancements On Off] (What's this?)

1962.
J. L. Borges, Ficciones, Grove Press, New York, 1962. (translated from the Spanish).
  • Calvin C. Elgot and Abraham Robinson, Random-access stored-program machines, an approach to programming languages, J. Assoc. Comput. Mach. 11 (1964), 365–399. MR 174193, DOI 10.1145/321239.321240
  • Rózsa Péter, Rekursive Funktionen, Akademischer Verlag, Budapest, 1951 (German). MR 0044467
  • Hartley Rogers Jr., Theory of recursive functions and effective computability, McGraw-Hill Book Co., New York-Toronto, Ont.-London, 1967. MR 0224462
  • Rózsa Péter, Über die Verallgemeinerung der Theorie der rekursiven Funktionen für abstrakte Mengen geeigneter Struktur als Definitionsbereiche, Acta Math. Acad. Sci. Hungar. 12 (1961), 271–314 (German, with Russian summary). MR 136545, DOI 10.1007/BF02023919
  • J. C. Shepherdson and H. E. Sturgis, Computability of recursive functions, J. Assoc. Comput. Mach. 10 (1963), 217–255. MR 151374, DOI 10.1145/321160.321170
  • Michael A. Arbib, Theories of abstract automata, Prentice-Hall, Inc., Englewood Cliffs, N.J., 1969. MR 0321626
  • Günter Asser, Rekursive Wortfunktionen, Z. Math. Logik Grundlagen Math. 6 (1960), 258–278 (German). MR 130172, DOI 10.1002/malq.19600061506
  • Shih-hua Hu, Recursive algorithms. Theory of recursive algorithms I, Acta Math. Sinica 10 (1960), 66–88 (Chinese, with English summary). MR 112833
  • Vladeta Vučković, Rekursive Wortarithmetik, Acad. Serbe Sci. Publ. Inst. Math. 14 (1960), 9–60 (German). MR 125790
  • Frieder Schwenkel, Rekursive Wortfunktionen über unendlichen Alphabeten, Z. Math. Logik Grundlagen Math. 11 (1965), 133–147 (German). MR 173634, DOI 10.1002/malq.19650110209
  • J. F. P. Hudson, Piecewise linear topology, W. A. Benjamin, Inc., New York-Amsterdam, 1969. University of Chicago Lecture Notes prepared with the assistance of J. L. Shaneson and J. Lees. MR 0248844

  • Review Information:

    Reviewer: Michael A. Arbib
    Journal: Bull. Amer. Math. Soc. 77 (1971), 512-521
    DOI: https://doi.org/10.1090/S0002-9904-1971-12735-0