Cryptography, Complexity, and Randomness

Jack Lutz

Speakers:

• Eric Allender (Rutgers): Curiouser and Curiouser: The Link between Incompressibility and Complexity
• Laurent Bienvenu (LIAFA, Paris 7): The Axiomatic Power of Kolmogorov Complexity
• Lance Fortnow (Northwestern University, Chicago): Applying Cryptography, Complexity and Randomness to Game Theory
• Valentine Kabanets (Simon Fraser University): Meta-Algorithms versus Circuit Lower Bounds
• Omer Reingold (Microsoft Research): The Many Entropies of One-Way Functions
• Alexander Shen (LIF Marseille, France): Game Arguments in Computability Theory and Algorithmic Information Theory

The Turing Test and Thinking Machines

Speakers:

• Bruce Edmonds (Manchester): Learning, Social Intelligence and the Turing Test - why an "out-of-the-box" Turing Machine will not pass the Turing Test
• John Preston (Reading): What are Computers (if they're not Thinking Things)?
• Susan Sterrett (Carnegie Mellon): Bringing up Turing's Child-Machine
• Kevin Warwick (Reading): Can Humans Be Said To Think?
• Jiří Wiedermann (Prague): On the Road to Thinking Machines: Insights and Ideas
• + Panel Discussion on Future Directions

Computational Models After Turing: The Church-Turing Thesis and Beyond

Speakers:

• Giuseppe Longo (CNRS, Paris): Computing? A Machine Imitating a Man in an Alphanumeric Game
• Péter Németi (Budapest): General Relativistic Computation, Black Hole Computing versus Wormhole Computing (joint work with Hajnal Andréka, István Németi and Gergely Székely)
• Stewart Shapiro (Columbus, Ohio): Computability, Open-texture, and the Church-Turing Thesis
• Matthew Szudzik (Carnegie Mellon): Is Turing's Thesis the Consequence of a Deeper Physical Principle?
• Philip Welch (Bristol): Transfinite Dynamical Models
• Michiel van Lambalgen (Amsterdam): How Reasoning Differs from Computation

Morphogenesis/Emergence as a Computability Theoretic Phenomenon

Peter Sloot

Speakers

• Jaap Kaandorp (Amsterdam): Modelling Gene Regulation of Morphogenesis
• Shigeru Kondo (Nagoya): Turing Pattern Formation Without Diffusion
• Nick Monk (Sheffield): From Turing to Wolpert, and Back Again
• John Reinitz (Chicago)
• James Sharpe (Barcelona): What About the Horse Part? Models of Multicellular Development
• Jonathan Sherratt (Edinburgh): Turing Patterns in Deserts

Open Problems in the Philosophy of Information

Benedikt Löwe

Speakers:

• Patrick Allo (Vrije Universiteit Brussel): Information and Logical Discrimination
• Luís Antunes (Porto University): Robustness of Logical Depth
• Mark Finlayson (M.I.T.): Sets of Signals, Information Flow, and Folktales
• Amos Golan (American University, Washington DC): On the Foundations and Philosophy of Info-Metrics
• Ruth Millikan (University of Connecticut): Natural Information
• + Panel Discussion on Future Directions

The Universal Turing Machine, and History of the Computer

John Tucker

Speakers:

• Jack Copeland (Canterbury, New Zealand): Birth of the Universal Turing Machine
• Steven Ericsson-Zenith (Palo Alto): Conceptions Of Locality In Logic And Computation, A History
• Ivor Grattan-Guinness (London): On Mathematicians Who Liked Logic: The Case of Max Newman
• Mark Priestley (Westminster): Why the ACE Had No Order Code
• Bruno Scarpellini (Universität Basel): Undecidable Propositions by Fourier Series
• Robert I. Soare (University of Chicago): Mathematics and the Turing Renaissance
• John Tucker (Swansea): The Church Turing Thesis Then and Now