Final i Programmeringsolympiaden, Sveriges största gymnasietävling i problemlösning med hjälp av programmering.
Se http://progolymp.se/ för vidare information eller kontakta Fredrik Heintz, epost email@example.com, telefon 070-207 43 88.
Brian Cantwell Smith, University of Toronto: The unsolvability of the halting problem is one of the most famous results in computer science. Curiously, though, the halting problem is easy to solve, if you use non-standard encodings. But as everyone knows, non-standard encodings are illegal. Computability theory requires that numbers be represented on tapes by "reasonable" encodings. This fact raises three foundational questions: 1. If reasonable representations are so important, why are they so little studied? 2. What are the conditions on an encoding for it to be "reasonable"? 3. Where do these reasonableness constraints come from? Are they fundamentally physical, semantical, mathematical, or logical? I will propose answers to all three questions. Doing so, though, will require turning our classical understanding of the theory of computing upside down, with implications not only for computer science, but also for artificial intelligence and cognitive science.
Plats: Alan Turing, E-huset, Campus Valla
För vidare information kontakta Nils Dahlbäck, epost firstname.lastname@example.org.