1 TURING CENTENARY CONFERENCE CiE 2012: How the World Computes University of Cambridge 18-23 June, 2012 ABSTRACTS OF INFORMAL PRESENTATIONS I Table of Contents Collective Reasoning under Uncertainty and Inconsistency ............. 1 Martin Adamcik Facticity as the amount of self-descriptive information in a data set ..... 2 Pieter Adriaans Towards a Type Theory of Predictable Assembly ...................... 3 Assel Altayeva and Iman Poernomo Worst case analysis of non-local games ............................... 4 Andris Ambainis, Art¯ursBaˇckurs,Kaspars Balodis, Agnis Skuˇskovniks,ˇ Juris Smotrovs and Madars Virza Numerical evaluation of the average number of successive guesses ....... 5 Kerstin Andersson Turing-degree of first-order logic FOL and reducing FOL to a propositional logic ................................................ 6 Hajnal Andr´ekaand Istv´anN´emeti Computing without a computer: the analytical calculus by means of formalizing classical computer operations ............................ 7 Vladimir Aristov and Andrey Stroganov On Models of the Modal Logic GL .................................. 8 Ilayda˙ Ate¸sand C¸i˘gdemGencer 0 1-Genericity and the Π2 Enumeration Degrees ........................ 9 Liliana Badillo and Charles Harris A simple proof that complexity of complexity can be large, and that some strings have maximal plain Kolmogorov complexity and non-maximal prefix-free complexity. ................................. 10 Bruno Bauwens When is the denial inequality an apartness relation? ................... 11 Josef Berger Logical Agency: consulting instead of collecting ....................... 12 Carolina Blasio and Jo˜aoMarcos Virtual Worlds as Portals for Information Discovery ................... 13 Shannon Bohle On Turing Scores ................................................. 14 Richard Booth II Naive Unrevealably Secret Communication ........................... 15 Selmer Bringsjord Average Case Complexity of epsilon-NFA’s ........................... 16 Sabine Broda, Ant´onioMachiavelo, Nelma Moreira and Rog´erioReis Cavity motion affects entanglement ................................. 17 David Edward Bruschi, Ivette Fuentes, Jorma Louko, Antony Lee, An- drzej Dragan and Nicolai Friis Heuristics and Intelligence: Realizing Turing’s Vision .................. 18 Cameron Buckner Notes on Spiking Neural P systems and Petri nets ..................... 19 Francis George Cabarle and Henry Adorna Interweavings of Alan Turings Mathematics and Sociology of Knowledge 20 Isabel Cafezeiro and Ivan Da Costa Marques The Legacy of Turing Reducibility .................................. 21 William Calhoun The distribution of the ITRM-recognizable reals ...................... 22 Merlin Carl Eigenforms, natural computing and morphogenesis .................... 23 Arturo Carsetti Bounded Primitive Recursive Randomness ........................... 24 Douglas Cenzer Resolution Systems with Substitution Rules .......................... 25 Anahit Chubaryan and Armine Chubaryan Linearization of Proofs in Propositional Hilbert Systems ............... 26 Karel Chvalovsk´y Imperfect Information in Logic and Concurrent Games ................ 27 Pierre Clairambault, Julian Gutierrez and Glynn Winskel Infinity, Interaction and Turing Machines ............................ 28 Paul Cockshott and Greg Michaelson Mental Experience and The Turing Test: This Double Face is the Face of Mathematics .................................................. 29 Leon N Cooper and Sorin Istrail Are Bacteria Unconventional Computing Architectures? ............... 30 Jole Costanza, Claudio Angione, Pietro Lio’ and Giuseppe Nicosia III Algorithmic complexity, entropy and the discovery of causal correlations . 31 Duilio D’Alfonso Computational Complexity of Interactive Behaviors ................... 33 Ugo Dal Lago, Tobias Heindel, Damiano Mazza and Daniele Varacca Book Presentation: ‘The Dawn of Software Engineering: from Turing to Dijkstra’ ...................................................... 34 Edgar Daylight Revamping the Turing Test by Computing Interaction Coupling ........ 35 Gregorio de Miguel Casado and Manuel Gonz´alezBedia A short history of small machines ................................... 36 Liesbeth De Mol and Maarten Bullynck Complexity of Fast Searching ....................................... 37 Oznur Yasar Diner, Dariusz Dereniowski and Danny Dyer Alan Turings Legacy: Info-Computational Philosophy of Nature ......... 38 Gordana Dodig Crnkovic Applicative theories for logarithmic complexity classes ................. 39 Sebastian Eberhard A Simplified Characterisation of Provably Computable Functions of the System ID1 ................................................... 40 Naohi Eguchi and Andreas Weiermann Automated Certification of a Logic-Based Verification Method for Imperative Loops ................................................. 41 Madalina Erascu and Tudor Jebelean Toward the unification of logic and geometry as the basis of a new computational paradigm ........................................... 42 Steven Ericsson-Zenith Intuitionistic asymmetry: how the CBN/CBV duality breaks ........... 43 Jose Espirito Santo A Semantic Framework for Real Computation with Polynomial Enclosures 44 Amin Farjudian Palindromic completion, a basis for hairpin completion ................ 45 Szilard Zsolt Fazekas, Robert Mercas and Kayoko Shikishima-Tsuji Cancellation-free circuits: An approach for proving superlinear lower bounds for linear Boolean operators ................................. 46 Magnus Gausdal Find and Joan Boyar IV Ambiguity of ω-Languages of Turing Machines ........................ 47 Olivier Finkel Turing Incomputable Computation .................................. 48 Michael Fiske De Finettis bets on partially evaluated Kripke frames ................. 49 Tommaso Flaminio and Hykel Hosni Reverse mathematics and a packed Ramsey’s theorem. ................ 50 Stephen Flood Structures presentable by various types of automata ................... 51 Ekaterina Fokina and Pavel Semukhin Ultrametric versus Archimedean automata ........................... 52 Rusins Freivalds Digital Computation as Instructional Information Processing ........... 53 Nir Fresco Recursive marriage theorems and reverse mathematics ................. 54 Makoto Fujiwara, Kojiro Higuchi and Takayuki Kihara A simple and complete model theory for intensional and extensional untyped lambda-equality ........................................... 55 Michael Gabbay The enumeration degrees of semi-recursive sets ....................... 56 Hristo Ganchev Generating DNA Code Words Using Forbidding and Enforcing Systems .. 57 Daniela Genova and Kalpana Mahalingam Complexity of the Continued Fractions of Some Subrecursive Real Numbers ......................................................... 58 Ivan Georgiev On modernisation of historical texts ................................. 59 Stefan Gerdjikov Sequent calculus with algorithmic properties for logic of correlated knowledge ....................................................... 60 Haroldas Giedra and J¯urat˙eSakalauskait˙e Approximating Asymmetric Metric TSP in Exponential Time .......... 61 Alexander Golovnev V Uncomputable Games: Toward Crowd-sourced Solving of Truly Difficult Problems ........................................................ 62 Naveen Sundar Govindarajulu Structure Diagrams in Type Theory ................................. 63 Henson Graves Quantum Secret Sharing with Graph States ......................... 64 Sylvain Gravier, J´erˆomeJavelle, Mehdi Mhalla and Simon Perdrix Systems and Methods for Data and Algorithm Protection .............. 65 Marc Groz Self Developing Network ........................................... 66 Fred Gruau Equilibriation of information in software systems ...................... 67 Les Hatton Some constraints on the physical realizability of a mathematical construction ...................................................... 68 Francisco Hern´andez-Quiroz and Pablo Padilla-Longoria Slow and steady wins the race: relationship between accuracy and speed of Turing pattern formation ................................... 69 Ken-Ichi Hiraga, Kota Ikeda and Takashi Miura Computer Science Through Urn Games: A Unified Framework for a Hierarchy of Solvable and Unsolvable Problems ....................... 70 Sorin Istrail Turing and von Neumanns Brains and their Computers ............... 71 Sorin Istrail and Solomon Marcus A Model of Computing as a Service for Cost Analysis ................. 72 Kenneth Johnson and John V. Tucker Languages Associated with Crystallographic Structures ................ 73 Natasha Jonoska, Mile Krajcevski and Gregory McColm Turing Machines, revisited ......................................... 74 Joost Joosten Uniformly Polynomial-time Computable Operators on Analytic Functions 75 Akitoshi Kawamura, Norbert M¨uller, Carsten R¨osnickand Martin Ziegler Second-Order Representations and Complexity of Compact Sets ........ 76 Akitoshi Kawamura, Carsten R¨osnickand Martin Ziegler VI Σ-complete structures and universal functions ........................ 77 Asylkhan Khisamiev On the Computational Strength of Infinite Time Blum Shub Smale Machines ........................................................ 78 Peter Koepke and Andrey Morozov On Uniform Computability in Familiar Classes of Projective Planes ..... 79 Nurlan Kogabaev Polynomial-Time Modifications of Church-Turing Thesis for Three Programming Languages ........................................... 80 Nikolay Kosovskiy Permutation Pattern