A Variant to Turing's Theory of Computing Machines
Journal of the ACM (JACM)
Computability of Recursive Functions
Journal of the ACM (JACM)
A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM (JACM)
On the Time Required to Perform Multiplication
Journal of the ACM (JACM)
Computational Complexity of One-Tape Turing Machine Computations
Journal of the ACM (JACM)
Computation: finite and infinite machines
Computation: finite and infinite machines
Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)
Toward a theory of enumerations
SWAT '68 Proceedings of the 9th Annual Symposium on Switching and Automata Theory (swat 1968)
Computation times for finite groups, semigroups and automata
FOCS '67 Proceedings of the 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)
Hi-index | 14.98 |
Scientific writing has long been adversely affected by the common misconception that "objective" and "dull" must be synonyms. That this is not the case Professor Arbib has once more proven by producing a sound and scientifically precise book that is also a pleasure to read. It will elicit more than just an occasional chuckle from its readers, and may even send some of them scurrying for their dictionaries with Greek polysyllables as "prolegomenon," "idiosyncratic," "palindrome," "polycephalic," and others; their search is doomed to failure with "possibilistic," for the author has apparently coined this one himself. Sometimes it is difficult to separate his wit from misprints and misspellings as in "... partial recursive with respect to one radix, they are partial recursive with respect to all radishes," granted, even, that "radish" comes from the same Latin word for "root," "radix." The flavor of the book is certainly unique. Can the reader think of any other book on automata theory closing with a phrase even remotely resembling "That is why both nature and nurture are important"?