[FOM] Simple Turing machines, Universality, Encodings, etc.

Kreinovich, Vladik vladik at utep.edu
Sat Nov 3 13:33:01 EDT 2007


May I add Yuri Gurevich's Abstract State Machines
http://www.eecs.umich.edu/gasm/ 

> From Andrej Bauer

> there are several ways of making computability theory "more abstract".
Some 
> possible approaches I have seen are described below. 

> I would very much like to hear about
> relevant work that was not mentioned by Vaughan Pratt or me.



More information about the FOM mailing list