TURING CENTENARY CONFERENCE
CiE 2012 - How the World Computes
Print this page
Accepted Papers
CiE 2012 Accepted Papers
(provided by EasyChair, in no special order)
Thomas Woolley,
Ruth Baker, Eamonn Gaffney and Philip Maini.
Stochastic reaction and diffusion on growing domains: understanding the breakdown of robust pattern formation
Chaudhary Imran Sarwar.
Alan Turing and Conventional, Virtual, Robotic, and Mixed Reality Leadership
Richard Statman.
A New Type Assignment for Strongly Normalizable Terms
James D Murray.
After Turing - Mathematical modelling in the biomedical and social sciences: from animal coat patterns to brain tumours to saving marriages.
Fernando Ferreira.
A short note on Spector's consistency proof of analysis
Henson Graves.
Structure Diagrams in Type Theory
Mark Burgin and Eugene Eberbach.
Evolutionary Turing in the Context of Evolutionary Machines and Computations
George Metcalfe and Christoph Röthlisberger.
Unifiability and Admissibility in Finite Algebras
What are Computers (if they're not Thinking Things)?
Ilkka Törmä and Ville Salo.
On Shift Spaces with Algebraic Structure
Steven Ericsson-Zenith.
Toward the unification of logic and geometry as the basis of a new computational paradigm
Armin Hemmerling.
On the Tape-Number Problem for Deterministic Time Classes
Douglas Bridges and Robin Havea.
Square roots and powers in constructive Banach algebra theory
Anahit Chubaryan and Armine Chubaryan.
A Hierarchy of Resolution Systems with Restricted Substitution Rules
Richard Booth.
On Turing Scores
Isabel Cafezeiro and Ivan Da Costa Marques.
Interweavings of Alan Turing's Mathematics and Sociology of Knowledge. Sequent calculus with algorithmic properties for logic of correlated knowledge
Hartmut Ehrig, Claudia Ermel, Falk Hüffner, Rolf Niedermeier and Olga Runge.
Confluence in Data Reduction: Bridging Graph Transformation and Kernelization
Fotini Markopoulou.
The Computing Spacetime
Antoine Taveneaux, Bjørn Kjos-Hanssen and Neil Thapen.
How much randomness is needed for statistics?
Nikolay Kosovskiy.
Polynomial-Time Modifications of Church-Turing Thesis for Three Programming Languages
Haroldas Giedra and Jûratė Sakalauskaitė.
Sequent calculus with algorithmic properties for logic of correlated knowledge
Xin-She Yang.
Optimality for Exploration and Exploitation in Metaheuristic Optimization Algorithms
Katerina Senkevich and Boris Solon.
Relationships between almost partial m-reducibility and other enumeration reducibilities
Yijia Chen, Jörg Flum and Moritz Mueller.
Hard Instances of Algorithms and Proof Systems
Stefano Mazzanti.
Bases for AC0 and other Complexity Classes
Vincent Ardourel and Julie Jebeile.
Cellular Automata Simulations: Are They Really of a Special Kind?
Sepp Hartung and André Nichterlein.
NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs
Yasushi Okuno and Shinnosuke Seki.
On the behavior of tile assembly system at high temperatures
Marcel Celaya and Frank Ruskey.
An Undecidable Nested Recurrence Relation
Franck Delaplace, Hanna Klaudel, Tarek Melliti and Sylvain Sené.
Analysis of modular organisation of interaction networks based on asymptotic dynamics
John Case, Sanjay Jain, Samuel Seah and Frank Stephan.
Automatic functions, linear time and learning
Sergio Rajsbaum, Maurice Herlihy and Dmitry Koslov.
Computability in Distributed Computing
Paul Cockshott and Greg Michaelson.
Tangled Tapes: Infinity, Interaction and Turing Machines
Anat Lerner and Rica Gonen.
A Difficulty in the Concept of Constrained Combinatorial Auctions
Jonathan Sherratt.
Turing Patterns in Deserts
Jaap Kaandorp, Daniel Botman, Carlos Tamulonis and Roland Dries.
Multi-scale modeling of gene regulation of morphogenesis
Victor Ocasio.
Turing Computable Embeddings and Coding Families of Sets
Loizos Michael.
Computability of Narrative
Darren Abramson.
Alan Turing's Defence of Multiple Realizability
Michael Gabbay.
A simple and complete model theory for intensional and extensional untyped lambda-equality
Stephane Massonet.
Turing and Wittgenstein : from the Foundations of Mathematics to Intelligent machines
Ken-Ichi Hiraga, Kota Ikeda and Takashi Miura.
Slow and steady wins the race: relationship between accuracy and speed of Turing pattern formation
Nir Fresco.
Computation as Instructional Information Processing
Thomas Fernique and Mathieu Sablik.
Local Rules for Computable Planar Tilings
Yuri Gurevich.
Foundational Analyses of Computation
Anders Johansson and James Zou.
A Slime Mold Solver for Linear Programming Problems
Arturo Berrones.
Phase transitions and long range dependence in connectionist models for approximately Bayesian learning
Aziz F. Zambak.
Mind as IRIS versus Mind as Machine
Kerstin Andersson.
Numerical evaluation of the average number of successive guesses
Akitoshi Kawamura, Norbert Müller, Carsten Rösnick and Martin Ziegler.
Uniformly Polynomial-time Computable Operators on Analytic Functions
Jeffrey Watumull.
The Linguistic Turing Machine
Tommaso Flaminio and Hykel Hosni.
De Finettib SakalauskaitDs bets on partially evaluated frames
Alexander Kulikov, Olga Melanich and Ivan Mihajlin.
A $5n-o(n)$ Lower Bound on the Circuit Size over $U_2$ of a Linear Boolean Function
Ugo Dal Lago, Tobias Heindel, Damiano Mazza and Daniele Varacca.
Computational Complexity of Interactive Behaviors
Makoto Fujiwara, Kojiro Higuchi and Takayuki Kihara.
Recursive marriage theorems and reverse mathematics
Lorenzo Carlucci and Konrad Zdanowski.
A note on Ramsey Theorems and Turing Jumps
Andris Ambainis, ArtE+rs BaD
kurs, Kaspars Balodis, Agnis E kuE!kovniks, Juris Smotrovs and Madars Virza.
Worst case analysis of non-local games
Filip Mazowiecki.
Continuous reductions of regular languages
Pierre Clairambault, Julian Gutierrez and Glynn Winskel.
Imperfect Information in Logic and Concurrent Games
Andreas Weiermann and Alan Woods.
Some natural zero one laws for ordinals below $\varepsilon_0$
Szilard Zsolt Fazekas, Robert Mercas and Kayoko Shikishima-Tsuji.
Palindromic completion, a basis for hairpin completion
Madalina Erascu and Tudor Jebelean.
Automated Certification of a Logic-Based Verification Method for Imperative Loops
Ray Dougherty.
Turing Machines Expressed as Chomsky Grammars in the Computational Universe: A Linguistic Complexity Metric
F. Félix Lara-Martín and
Andrés Cordón-Franco.
Local Induction and Provably Total Computable Functions: a Case Study
Péter Németi and Gergely Székely.
Existence of Faster Than Light Signals Implies Hypercomputation Already in Special Relativity
Loizos Michael.
Simultaneous Learning and Prediction
Vladimir Aristov and Andrey Stroganov.
Computing without a computer: the analytical calculus by means of formalizing classical computer operations
Alexander Golovnev.
Approximating Asymmetric Metric TSP in Exponential Time
David Edward Bruschi, Ivette Fuentes, Jorma Louko, Antony Lee, Andrzej Dragan and Nicolai Friis.
Cavity motion affects entanglement
Roussanka Loukanova.
Computational Syntax-Semantics Interface of Passive Forms with The Language of Acyclic Recursion
Anderson De Araújo.
The world as a quantum system with degrees of incomputability
Yoshihiro Horihata.
Weak theories of concatenation and their mutual interpretabilities
Kojiro Higuchi and Takayuki Kihara.
Effective strong nullness and effectively closed sets
Marc Groz.
Systems and Methods for Data and Algorithm Protection
Petar Iliev and Wiebe Van Der Hoek.
On the relative succinctness of "everybody knows" and "somebody knows"
Natasha Jonoska, Mile Krajcevski and Gregory McColm.
Languages Associated with Crystallographic Structures
Roland Omanadze.
ON SOME PROPERTIES OF MAXIMAL SETS AND Q-REDUCIBILITY
George Barmpalias and Zhenhao Li.
Limit computable infinite games and the structure of their degrees of non-determinacy
Luis Antunes, Andre Souto and Andreia Teixeira.
Roboustness of Logical Depth
Yoshii Keisuke and Kazuyuki Tanaka.
Infinite Games and Transfinite Recursion of Multiple Inductive Definitions
Vasco Brattka, StC)phane Le Roux and Arno Pauly.
On the Computational Content of the Brouwer Fixed Point Theorem
Masaharu Mizumoto.
How to Accept Turingb SakalauskaitDs Thesis without Proof or Conceptual Analysis without also Feeling Qualms
Ningning Peng, Kojiro Higuchi, Takeshi Yamazaki and Kazuyuki Tanaka.
Relative Randomness for Martin-Löf random Sets
Robert Rettinger.
Compactness and the Effectivity of Uniformization
Ranjit Kumar Upadhyay and Sharada Nandan Raw.
Emergence of Spatial Patterns in a Model of Wetland Ecosystem: Application to Keoladeo National Park (KNP), India
Krishna S, Bogdan Aman and Gabriel Ciobanu.
On the Computability Power of Membrane Systems with Controlled Mobility
Gregorio de Miguel Casado and Manuel GonzC!lez Bedia.
Revamping the Turing Test by Computing Interaction Coupling
Daniela Genova and Kalpana Mahalingam.
Generating DNA Code Words Using Forbidding and Enforcing Systems
Peter Schuster and Matthew Hendtlass.
A direct proof of Wiener's theorem
Andrey Verisokin, Darya Verveyko and Eugene Postnikov.
Mathematical Model of Chaotic Oscillations and Oscillatory Entrainment in Glycolysis Originated from Periodic Substrate Supply
Darya Verveyko and Andrey Verisokin.
Computer Simulation of Three-Dimensional Reaction-Diffusion Models. Case Study: Glycolytic Reaction in Open Spatial Reactor
Leon N Cooper and Sorin Istrail.
Mental Experience and The Turing Test: This Double Face is the Face of Mathematics
Di Cai and Lee McCluskey.
A simple method for estimating term mutual information
Grant Passmore and Paul Jackson.
Abstract Partial Cylindrical Algebraic Decomposition I: The Lifting Phase
Dan Brumleve, Joel David Hamkins and Philipp Schlicht.
The mate-in-n problem of infinite chess is decidable
Benedek Nagy, Veronika Halsz, Lszl Heged and Istvn Hornyk.
Solving application oriented graph theoretical problems with DNA computing
Bruno Bauwens.
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.
Jole Costanza, Claudio Angione, Pietro Lio' and Giuseppe Nicosia.
Bacteria as Unconventional Computing Architectures
Mikhail Peretyatkin.
On the Tarski-Lindenbaum algebra of the class of all strongly constructivizable prime models
Amos Golan.
On the Foundations and Philosophy of Info-Metrics
Joerg Zimmermann and Armin Cremers.
Making Solomonoff Induction Effective or You Can Learn What You Can Bound
Sorin Istrail.
Computer Science Through Urn Games: A Unified Framework for a Hierarchy of Solvable and Unsolvable Problems
Anargyros Sarafopoulos.
A Shape Language for IFS
Anargyros Sarafopoulos.
Evolutionary Art, Artificial Critics, Aesthetics, and Hilbert's Entscheidungsproblem
Trees for Subtoposes of the Effective Topos
S. G. Sterrett.
Bringing Up Turing's Child-Machine
Bruce Edmonds and Carlos Gershenson.
Learning, Social Intelligence and the Turing Test - why an 'out-of-the-box' Turing Machine will not pass the Turing Test
Francis Rousseaux, Alain Bonardi and Antoine Vincent.
Collection-centred Analysis and Design: Because We Should Not Have to Choose between Ludus and Paidia while Building our Interactive AI Systems
Chung-Chih Li.
Is the Trilogy of Gap, Compression, and Honesty Theorems Still Significant at Type-2?
Stephen Flood.Reverse mathematics and a packed Ramsey's theorem.
Ivor Grattan-Guinness.
On mathematicians who liked logic: the case of Max Newman
Manuel Mazzara, Antonio Marraffa, Luca Biselli, Simona De Nicola, Luca Chiarabini and Georgios Papageorgiou.
Social Networks and Collective Intelligence
Nurlan Kogabaev.
On Uniform Computability in Familiar Classes of Projective Planes
Margarita Leontyeva.
On Existence of Strongly Computable Copies in Class of Boolean Algebras
Stefan Gerdjikov.
On modernisation of historic texts
Philippe Codognet.
Turing, Mechanism and Blind Thought
Philippe Codognet.
Turing, Search and Randomness
Mariam Thalos and Oliver Richardson.
The Morals of the St. Petersburg Game: Why Statistical Distributions Matter in Prospect Appraisal
Eugene Postnikov.
Computational model based on meteorological data for forecast of influenza-like activity
Andrey Sariev.
The Omega-Turing degrees
Paola Zizzi.
The modality "Future" for Probably true propositions
Matthew Wright.
Degrees of Relations on Ordinals
Rema Padman, Daniel Neill and Chris Harle.
Information Visualization for Cognitively Guided Health Risk Assessment
Francisco Javier Almaguer, Arturo Berrones, Mónica Alcalá,
Roberto Soto, Oscar Chacón, Ricardo Sánchez and Eduardo Soto.
Cellular Automaton in Aggregation and Breaking Processes
Duilio D'Alfonso.
Algorithmic complexity, entropy and the discovery of causal correlations
Ivan Georgiev.
Complexity of the Continued Fractions of Some Subrecursive Real Numbers
Sergey Ospichev.
Computable Numberings in Ershov Hierarchy
Magnus Gausdal Find and Joan Boyar.
Cancellation-free circuits: An approach for proving superlinear lower bounds for linear Boolean operators
Akitoshi Kawamura, Carsten
Rösnick and Martin Ziegler.
Second-Order Representations and Complexity of Compact Sets
Martin Adamcik.
Collective Reasoning under Uncertainty and Inconsistency
Benoît
Monin.Von Neumann's Biased Coin Revisited
Sabine
Broda, António Machiavelo,
Nelma
Moreira and Rogério
Reis.Average Case Complexity of epsilon-NFA's
Peter Wegner.
Alan Turing and Maurice Wilkes
Hristo Ganchev.
The enumeration degrees of semi-recursive sets
Catherine Stinson.
Computational Models as Mechanistic Explanations
Yun Shang, Xian Lu and Ruqian Lu.
Closure Properties of Quantum Turing Languages
Sergei Podzorov.
Computable C-classes
Sylvain Gravier, Jérôme
Javelle, Mehdi Mhalla
and Simon Perdrix.
Quantum Secret Sharing with Graph States
Eva Maia, Nelma Moreira and Rogério
Reis.Incomplete Transition Complexity of Basic Operations on Regular Languages
Iosif Petrakis and Helmut Schwichtenberg.On the Formal Constructive Theory of Computable Functionals TCF+
Mitko Yanchev.
Part restrictions: adding new expressiveness in Description Logics
Karel Chvalovský.
Linearization of Proofs in Propositional Hilbert Systems
Loizos Michael.
Ant Collectives as Computers
Kenji Miyamoto and Helmut Schwichtenberg.Program Extraction with Nested Inductive/Coinductive Definitions
Juan Carlos Garcia Escartin and Pedro Chamorro-Posada.
Distributed computation in inertial frames
Marcin J. Schroeder.
Structural versus Quantitative Characteristics of Information in Information Processing: Information Integration
WebSense: Making Sense of the Web
Yoshihiro Maruyama.
Categorical Universal Logic: Duality as Semantics
Benjamin Rin.
The computational strengths of alpha-length infinite time Turing machines
Naveen Sundar Govindarajulu.
Uncomputable Games: Toward Crowd-sourced Solving of Truly Difficult Problems
Naohi Eguchi and Andreas Weiermann.
A Simplified Characterisation of Provably Computable Functions of the System ID_1
Lindsay Smith, Vito Veneziano and Paul Wernick.
The use of language and logic in computing technology
Joseph Shipman and John H. Conway.
Geometric Models of Computation
Ashish Umre and Ian Wakeman.
Dynamics of Agent Interaction: In search of strategies for optimal information sharing
Carolina Blasio and João
Marcos.Logical Agency: consulting instead of collecting
Francisco
Hernández-Quiroz and Pablo Padilla-Longoria.
Some constraints on the physical realizability of a mathematical construction
Peter Koepke and Andrey Morozov.
On the Computational Strength of Infinite Time Blum Shub Smale Machines
Hajnal
Andréka and István
Németi.Turing-degree of first-order logic FOL and reducing FOL to a propositional logic
= invited paper
= contributed paper
= informal presentationPlease send queries/amendements for this list to: Barry Cooper pmt6sbc @ leeds.ac.uk |
