Computability and Computational Complexity of/in Physical Theories

Dr. Martin Ziegler, TU Wien

9 Apr 2009, 14:30; Location: S4|10-1

We combine the classical theories of discrete computation (Turing computability and complexity classes like NP) and real number computation (Recursive Analysis and BSS model) with Theoretical Physics in order to
1. investigate physical foundations of computing (Church-Turing Hypothesis) and
2. devise a complexity theory of computer simulation including optimality proofs (upper and lower running time bounds) for simulation algorithms.

Category: CE Seminar


Technische Universität Darmstadt

Graduate School CE
Dolivostraße 15
D-64293 Darmstadt

Phone+49 6151/16-24401
Fax -24404

to assistants' office

Open BSc/MSc Theses

Show a list of open BSc/MSc topics at GSC CE.

 Print |  Impressum |  Sitemap |  Search |  Contact |  Privacy Policy
zum Seitenanfangzum Seitenanfang