Interaction as a basis for empirical computer science

Computer scientists are blessed with a universal device which can be instructed to perform any computation and simulate any physical process (as described by our current laws of physics), but which is therefore chaotic and must be controlled with unprecedented precision. This is achieved by the successive layers of implemented abstraction wrapped around the chaotic universal machines that help to bridge the many orders of magnitude in the scale of things, JURIS HARTMANIS, Communications of the ACM, Oct. 1994

[1]  Butler W. Lampson,et al.  Atomic Transactions , 1980, Advanced Course: Distributed Systems.

[2]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[3]  Alan M. Turing,et al.  Systems of Logic Based on Ordinals , 2012, Alan Turing's Systems of Logic.

[4]  Peter Wegner,et al.  Tradeoffs between reasoning and modeling , 1993 .

[5]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.