Computability, Complexity, and Practice of Real Computation
Tutorial at the University of Tokyo, Jan.30 to Feb.1 (2018)
This short lecture conveys the conceptional background to
contemporary computational approaches in Engineering:
Synopsis:
We first recall the limits of algorithmic solvability (Halting problem),
then proceed to efficiency questions (complexity) in the discrete realm,
finally extend both to approximate computation on continuous (e.g. real) data,
and conclude with some practical programming using the C++
library iRRAM.