Sequential abstract-state machines capture sequential algorithms

BLASS A., 1997, The linear time hierarchy theorem for RAMs and abstract state machines, J. Univ. Comput. Sci., 3, 247

BLASS A., 1999, Choiceless polynomial time, Ann. Pure Appl. Logic, 100, 1, 10.1016/S0168-0072(99)00005-6

BLUM L., 1989, On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines, Bull. Am. Soc. Inf. Sci., 21, 1, 10.1090/S0273-0979-1989-15750-9

RGER E., 1995, Proceedings of the 22nd Seminar on Current Trends in Theory and Practice of Informatics (SOFSEM '95), 1012

RGER E., 1999, Proceedings of the Conference on Current Trends in Applied Formal Languages (FM-Trends '98), 1641

RGER E., 1998, Abstract state machines 1988-1998: Commented ASM bibliography, Bull. Eur. Assoc. Theoret. Comput. Sci., 64, 105

B RGER E. GR DEL E. AND GUREVICH Y. 1996. Classical Decision Problem. Springer-Verlag Berlin Germany.]] B RGER E. GR DEL E. AND GUREVICH Y. 1996. Classical Decision Problem. Springer-Verlag Berlin Germany.]]

CHANDY K. M. AND MISRA J. 1988. Parallel Program Design: A Foundation. Addison-Wesley Longman Publ. Co. Inc. Reading MA.]] CHANDY K. M. AND MISRA J. 1988. Parallel Program Design: A Foundation. Addison-Wesley Longman Publ. Co. Inc. Reading MA.]]

CHURCH A., 1936, An unsolvable problem of elementary number theory, Am. J. Math., 58, 345, 10.2307/2371045

COOK S. A., 1973, Time-bounded random access machines, J. Comput. Syst. Sci., 7, 354, 10.1016/S0022-0000(73)80029-7

GANDY R., 1980, The Kleene Symposium, J. Barwise, H. J. Keisler, and K. Kunen, Eds. 123-148

GRIES D., 1990, The maximum-segment-sum problem. In Formal Development Programs and Proofs, E. W. Dijkstra, Ed. Addison-Wesley University of Texas at Austin year of programming series. Addison-Wesley Longman, Publ. Co., Inc., Reading, MA, 33

GRIGORIEV D., 1980, Kolmogorov algorithms are stronger than Turing machines, J. Sov. Math., 14, 1445, 10.1007/BF01693975

GUREVICH Y., 1985, A new thesis, Am. Math. Soc. Abstracts, 6, 4

GUREVICH Y., Current Trends in Theoretical Computer Science

GUREVICH Y., Current Trends in Theoretical Computer Science

GUREVICH Y., Specification and Validation Methods, E. B rger, Ed

GUREVICH Y., 1997, Tech. Rep. CSE-TR-336-97. University of Michigan

GUREVICH Y., 1999, The sequential ASM thesis, Bull. Eur. Assoc. Theoret. Comput. Sci., 67, 93

GUREVICH Y., 1997, Recursive abstract state machines, J. Univ. Comput. Sci., 3, 233

KNUTH D. E. 1968. The Art of Computer Programming. Vol. 1 Fundamental Algorithms. Addison-Wesley Reading MA.]] KNUTH D. E. 1968. The Art of Computer Programming. Vol. 1 Fundamental Algorithms. Addison-Wesley Reading MA.]]

KOLMOGOROV A. N., 1953, On the concept of algorithm, Uspekhi Mat. Nauk, 8, 175

KOLMOGOROV A. N., 1958, On the definition of algorithm, Uspekhi Mat. Nauk, 13, 3

MARKOV A.A., 1954, Jerusalem

SAVAGE J. E. 1987. The Complexity of Computing. Krieger Publishing Co. Inc. Melbourne FL.]] SAVAGE J. E. 1987. The Complexity of Computing. Krieger Publishing Co. Inc. Melbourne FL.]]

SAVAGE J. E. 1998. Models of Computation: Exploring the Power of Computing. Addison-Wesley Longman Publ. Co. Inc. Reading MA.]] SAVAGE J. E. 1998. Models of Computation: Exploring the Power of Computing. Addison-Wesley Longman Publ. Co. Inc. Reading MA.]]

SCH NHAGE A., Automatentheorie und Formale Sprachen, J. D rr and G

SCH NHAGE A., 1980, Storage modification machines, SIAM J. Comput., 9, 490, 10.1137/0209036

TARSKI A., 1923, Logic

TURING A., 1936, On computable numbers with an application to the Entscheidungsproblem, Proc. London Math. Soc., 2, 230

USPENSKY V.A., 1992, Kolmogorov and mathematical logic, J. Symb. Logic, 57, 385, 10.2307/2275276