Zobrazeno 1 - 10
of 59
pro vyhledávání: '"Calvin C. Elgot"'
Autor:
Calvin C. Elgot, Stephen L. Bloom
Cal Elgot was a very serious and thoughtful researcher, who with great determi nation attempted to find basic explanations for certain mathematical phenomena as the selection of papers in this volume well illustrate. His approach was, for the mos
Publikováno v:
SIAM Journal on Computing. 9:525-540
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d12c530664ba5b90023fe0fe14e82338
https://doi.org/10.1137/0209039
https://doi.org/10.1137/0209039
Publikováno v:
Information Processing Letters. 14:128-131
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f3fa07ddbb0feb19ad19c227e16bbc66
https://doi.org/10.1016/0020-0190(82)90069-2
https://doi.org/10.1016/0020-0190(82)90069-2
Autor:
Calvin C. Elgot, Lawrence Snyder
Publikováno v:
Theoretical Computer Science. 5:275-305
This is an in depth study of “list” in the sense of LISP. In particular, the notion is algebraicized.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2dd4f1b85ee2711d9db2294b84aee340
https://doi.org/10.1016/0304-3975(77)90046-9
https://doi.org/10.1016/0304-3975(77)90046-9
Autor:
Calvin C. Elgot
Publikováno v:
Journal of Pure and Applied Algebra. 19:85-90
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3e63311315def3ec9f13b70e8c346979
Autor:
Calvin C. Elgot, Abraham Robinson
Publikováno v:
Journal of the ACM. 11:365-399
A new class of machine models as a framework for the rational discussion of programming languages is introduced. In particular, a basis is provided for endowing programming languages with semantics. The notion of Random-Access Stored-Program Machine
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7215f4adb91435dc370282d92ed32d3d
https://doi.org/10.1145/321239.321240
https://doi.org/10.1145/321239.321240
Autor:
Calvin C. Elgot
Publikováno v:
Computing. 6:349-370
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d5beb00e4477e89a8b633d65bb4f59e4
https://doi.org/10.1007/bf02238820
https://doi.org/10.1007/bf02238820
Autor:
Calvin C. Elgot
Publikováno v:
Transactions of the American Mathematical Society. 98:21-51
1. Motivation. Many variants of the notion of automaton have appeared in the literature. We find it convenient here to adopt the notion of E. F. Moore [7]. Inasmuch as Rabin-Scott [9] adopt this notion, too, it is convenient to refer to [9] for vario
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b179ad1542f9ac4982c217a4c8c86910
https://doi.org/10.1090/s0002-9947-1961-0139530-9
https://doi.org/10.1090/s0002-9947-1961-0139530-9
Autor:
Calvin C. Elgot, Michael O. Rabin
Publikováno v:
Journal of Symbolic Logic. 31:169-181
We study certain first and second order theories which are semantically defined as the sets of all sentences true in certain given structures. Let be a structure where A is a non-empty set, λ is an ordinal, and Pα is an n(α)-ary relation or functi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::73530fabae162cad3519674ad0ab82a5
https://doi.org/10.2307/2269808
https://doi.org/10.2307/2269808
Publikováno v:
Journal of the ACM. 5:181-196
In Representation of Events in Nerve Nets and Finite Automata [3], S. C. Kleene obtains a number of interesting results. The most important of these, his analysis and synthesis theorems (theorems 5 and 3), are obscured both by the complexity of his b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::acd7416564504c44c6c81a8a4f4d270d
https://doi.org/10.1145/320924.320931
https://doi.org/10.1145/320924.320931