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 smallstep algorithms I: Axiomatization Logical Methods in Computer Science. 2007. Andreas Blass, Yuri Gurevich, Dean Rosenzweig, and Benjamin Rossman (2007b) Interactive smallstep 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 20130810 01:01  LtU Forum  previous forum topic  next forum topic  other blogs  5055 reads

Browse archivesActive forum topics 
Recent comments
3 hours 7 min ago
3 hours 22 min ago
3 hours 33 min ago
4 hours 7 min ago
4 hours 26 min ago
5 hours 57 min ago
1 day 4 hours ago
1 day 11 hours ago
1 day 21 hours ago
1 day 22 hours ago