User loginNavigation |
archivesGlobal 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. Glitch: A Live Programming ModelA short 3 page workshop paper* submission. I've written to briefly describe Glitch. It has been a long journey from FRP signals to a model where I can actually write programs that I want to write. Abstract:
* Apologies for using SkyDrive, it was just convenient. Use the download link and ignore the horrid Office 365 PDF viewer. |
Browse archivesActive forum topics |
Recent comments
22 weeks 4 days ago
22 weeks 4 days ago
22 weeks 4 days ago
44 weeks 5 days ago
49 weeks 9 hours ago
50 weeks 4 days ago
50 weeks 4 days ago
1 year 1 week ago
1 year 5 weeks ago
1 year 5 weeks ago