The Incomputable
PLENARY TALKS
- Samson Abramsky (Oxford): Intensionality, Definability and Computation
- Martin Davis (Berkeley/New York): Contributions of E. L. Post to the Study of the Incomputable
- Fay Dowker (Imperial College, London): A Framework for Logic in Physics
- Seth Lloyd (MIT): A Turing Test for Free Will
- Philip Maini (Oxford): Turing's Theory for Biological Pattern Formation
- Yuri Matiyasevich (St Petersburg): Turing Machines vs Diophantine Machines
- Cris Moore (Santa Fe): P vs NP, Phase Transitions, and Incomputability in the Wild
- István Németi/ Hajnal Andréka (Budapest): Relativistic Computing Beyond the Turing Barrier
- Theodore A Slaman (Berkeley): The Mathematics of Relative Computability
- Robert I Soare (Chicago): Church-Turing Completeness: Syntax and Semantics
- Vlatko Vedral (Oxford): What Features of Living Systems Can We Simulate on a Quantum Computer?
SPECIAL SESSIONS
The Mathematics of Incomputability
- Klaus Ambos-Spies (Heidelberg): On the Strongly Bounded Turing Degrees of C.E. Sets: Degrees Inside Degrees
- Marat M Arslanov (Kazan): Definable Relations in the Turing Degree Structures
- Douglas Cenzer (Gainesville): Structures and Isomorphisms in the Difference Hierarchy
- Peter Cholak (Notre Dame): The Computably Enumerable Sets: a Survey
- Rodney Downey (Wellington): Strong Jump Traceability, Part 1
- Sy Friedman (Vienna): Computational Complexity and Set Theory
- Noam Greenberg (Wellington): Strong Jump Traceability, Part 2
- Joel David Hamkins (CUNY): The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility
- Valentina Harizanov (Washington): Injections, Orbits, and Complexity
- Denis Hirschfeldt (Chicago): Categoricity Properties for Computable Algebraic Fields
- Julia Knight (Notre Dame): Classification of Countable Structures and the Effective Borel Hierarchy
- Antonin Kucera (Prague): Randomness and Classes of PA and DNC Functions in Computability
- Andrew Lewis (Leeds): The Complexity of Computable Categoricity
- Antonio Montalban (Chicago): A Computability Theoretic Equivalent to Vaught's Conjecture
- André Nies (Auckland): Ten Years of Triviality
- Richard A Shore (Cornell): Interpreting Arithmetic in the Turing Degrees Below Generics and Randoms
- Andrea Sorbi (Siena): Relative Computability of Partial Functions
- Ivan Soskov (Sofia): Definability Properties of Marker's Extensions
- Alexandra Soskova (Sofia): Enumeration Degree Spectra
- Philip Welch (Bristol): Generalised Transfinite Turing Machines and Strategies for Games
Exploring Real-World Complexity and Computability
- Mark Bishop (Goldsmiths): Trouble with Computation
- Cristian Calude (Auckland): The Halting Problem Revisited
- Bob Coecke (Oxford): How Computer Science Helps to Bring Quantum Physics to the Masses
- José Félix Costa (Lisbon): Classifying the Theories of Physics
- Vincent Danos (Edinburgh): Equilibrium and Termination
- Steven Ericsson-Zenith (Palo Alto): Computing With Structure
- Mark Hogarth (Cambridge): Would You Please Stop Talking About the Church-Turing Thesis, Please
- Elham Kashefi (Edinburgh): Quantum Turing Test
- Antonina Kolokolova (Newfoundland): How Hard is Proving Hardness? Logic Approach to Barriers in Complexity
- Giuseppe Longo (Paris): Turing, from the "Discrete State Machine" to the "Continuous Systems" for Morphogenesis
- Ursula Martin (London): What Can We Learn from Online Math?
- Mehrnoosh Sadrzadeh (Oxford): Compact Closed Categories and Frobenius Algebras for Computing Natural Language Meaning
- Aaron Sloman (Birmingham): The Meta-Morphogenesis of Virtual Machinery with "Physically Indefinable" Functions
- Mike Stannett (Sheffield): Hypercomputation, Physics and Computation
- Christof Teuscher (Portland): From Intrinsic to Designed Computation with Turing's Unorganized Machines
- John Tucker (Swansea): Computation, Measurement and the Interface Between Physical Systems and Algorithms
- Kumaraswamy (Vela) Velupillai (Trento): Incomputability in Economic Theory
- Peter Wegner (Brown University): Modern Computation
- Jiří Wiedermann (Prague): Computability and Non-Computability Issues in Amorphous Computing y