Event Information
Talk by Professor Stefan Wolf：An All-Or-Nothing Flavor to the Church-Turing Hypothesis
- Date
- Tuesday, July 18, 2017
- Time
- 10:45 - 11:45
- Venue
- Room W1008, West 8 (W), Oookayama campus
- Registration Fee
- free of charge
- Speaker
- Dr. Stefan Wolf (Professor, Università della Svizzera italiana, Switzerland)
- Contact
- Kirill Morozov morozov@c.titech.ac.jp
| Speaker | Stefan Wolf (Università della Svizzera italiana, Switzerland) |
|---|---|
| Title | An All-Or-Nothing Flavor to the Church-Turing Hypothesis |
| Abstract | Landauer's principle claims that "Information is Physical. " It is not surprising that its conceptual antipode, Wheeler's "It from Bit," has been more popular among computer scientists — in the form of the Church-Turing hypothesis: All natural processes can be computed by a universal Turing machine; physical laws then become descriptions of subsets of observable, as opposed to merely possible, computations. Switching back and forth between the two traditional styles of thought, motivated by quantum-physical Bell correlations and the doubts they raise about fundamental space-time causality, we look for an intrinsic, physical randomness notion and find one around the second law of thermodynamics. Bell correlations combined with complexity as randomness tell us that beyond-Turing computations are either physically impossible, or they can be carried out by "devices" as simple as individual photons. |
| Short Bio | Stefan Wolf is a professor for Informatics, working at USI since 2011. Born in Schaffhausen, Switzerland, he received a Dipl. Math. ETH, followed by a PhD in Computer Science from ETH Zurich under the supervision of Professor Ueli Maurer. After a postdoc at McGill University, Montreal, he was Assistant Professor at University of Waterloo, Ontario, and Université de Montréal, Quebec. From 2005 to 2011, he was an SNF Professor for Quantum Information at ETH Zurich. His research domain lies in the fields of cryptography, information theory, and quantum information processing. In particular, he is interested in an efficient realization of provably secure cryptographic and other information-processing functionalities based on weak classical or quantum-physical primitives. |
Update : July 13, 2017
