![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Nachum Dershowitz, Tel Aviv University
Wednesday 20 May 2015, 11:00-12:00
Generic Computational Models
- 👤 Speaker: Nachum Dershowitz, Tel Aviv University
- 📅 Date & Time: Wednesday 20 May 2015, 11:00 - 12:00
- 📍 Venue: Room FW26, Computer Laboratory, William Gates Building
Abstract
Gurevich’s abstract state machines provide a generic model of computation. He has shown that any transition system with logical structures as states and finitely-describable transitions can be emulated step-by-step and state-for-state by some abstract state machine.
This model can be extended to cover parallel computation, taking into account the ability of processes to spawn new processes. And the axiomatization can be refined to characterize effectiveness, by insisting that initial states can also be finitely described.
The Church-Turing Thesis, the Invariance Thesis, and the Parallel Computation Thesis follow from these formalizations.
Series This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Computing and Mathematics
- Department of Computer Science and Technology talks and seminars
- Interested Talks
- Logic and Semantics Seminar (Computer Laboratory)
- Martin's interesting talks
- Room FW26, Computer Laboratory, William Gates Building
- School of Technology
- tcw57’s list
- Trust & Technology Initiative - interesting events
- yk373's list
- yk449
Note: Ex-directory lists are not shown.