Continuous-space model of computation is Turing universal
Outline
Motivations
Previous approaches
Summary of the model
Memory & Control Flow
Matched filter correlation
General-purpose capabilities
Universality
Encoding the stack data
Push and Pop routines
Computational complexity
Future work
Conclusions
Complexity measures
Grammar
Email: tom.naughton@may.ie
Home Page: http://www.cs.may.ie/~tnaughton