BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Generic Computational Models - Nachum Dershowitz\, Tel Aviv Univer
 sity
DTSTART:20150520T100000Z
DTEND:20150520T110000Z
UID:TALK59511@talks.cam.ac.uk
CONTACT:Jonathan Hayman
DESCRIPTION:Gurevich’s abstract state machines provide a generic model o
 f\ncomputation. He has shown that any transition system with logical\nstru
 ctures as states and finitely-describable transitions can be\nemulated ste
 p-by-step and state-for-state by some abstract state\nmachine.\n\nThis mod
 el can be extended to cover parallel computation\, taking into\naccount th
 e ability of processes to spawn new processes.\nAnd the axiomatization can
  be refined to characterize effectiveness\,\nby insisting that initial sta
 tes can also be finitely described.\n\nThe Church-Turing Thesis\, the Inva
 riance Thesis\, and the Parallel\nComputation Thesis follow from these for
 malizations.
LOCATION:Room FW26\, Computer Laboratory\, William Gates Building
END:VEVENT
END:VCALENDAR