User loginNavigation |
Global State Machines Inadequate (contra Dijkstra and Gurevich et. al.)Global State Machines are an inadequate foundation for computation (contra Dijkstra and Gurevich et. al.) A principle limitation relates to the inability of Global State Machines to represent concurrency. See What is computation? Actor Model versus Turing's Model Global State Machine References Andreas Blass, Yuri Gurevich, Dean Rosenzweig, and Benjamin Rossman (2007a) Interactive small-step algorithms I: Axiomatization Logical Methods in Computer Science. 2007. Andreas Blass, Yuri Gurevich, Dean Rosenzweig, and Benjamin Rossman (2007b) Interactive small-step algorithms II: Abstract state machines and the characterization theorem Logical Methods in Computer Science. 2007. Edsger Dijkstra. A Discipline of Programming Prentice Hall. 1976. Edsger Dijkstra and A.J.M. Gasteren. A Simple Fixpoint Argument Without the Restriction of Continuity Acta Informatica. Vol. 23. 1986. By Hewitt at 2013-08-10 01:01 | LtU Forum | previous forum topic | next forum topic | other blogs | 6422 reads
|
Browse archives
Active forum topics
|
Recent comments
9 weeks 5 days ago
14 weeks 8 hours ago
15 weeks 4 days ago
15 weeks 4 days ago
18 weeks 2 days ago
22 weeks 6 days ago
22 weeks 6 days ago
23 weeks 2 days ago
23 weeks 2 days ago
26 weeks 1 day ago