Accepted Papers

CiE 2012 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
David Holcman and Zeev Schuss.
Finding small and hidden targets in cells
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
Fred Gruau.
Self Developing Network 2: Universal Machines
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
John Preston.
What are Computers (if they're not Thinking Things)?
Ilkka Törmä and Ville Salo.
On Shift Spaces with Algebraic Structure
Steven EricssonZenith.
Toward the unification of logic and geometry as the basis of a new computational paradigm
Armin Hemmerling.
On the TapeNumber Problem for Deterministic Time Classes
Josef Berger.
When is the denial inequality an apartness relation?
Douglas Bridges and Robin Havea.
Square roots and powers in constructive Banach algebra theory
Samuel Moelius.
Characteristics of Minimal Effective Programming Systems
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
Fotini Markopoulou.
The Computing Spacetime
Nikolay Kosovskiy.
PolynomialTime Modifications of ChurchTuring Thesis for Three Programming Languages
Haroldas Giedra and Jûratė Sakalauskaitė.
Sequent calculus with algorithmic properties for logic of correlated knowledge
XinShe Yang.
Optimality for Exploration and Exploitation in Metaheuristic Optimization Algorithms
Edgar Daylight.
Book Presentation: `The Dawn of Software Engineering: from Turing to Dijkstra'
Katerina Senkevich and Boris Solon.
Relationships between almost partial mreducibility and other enumeration reducibilities
Yijia Chen, Jörg Flum and Moritz Mueller.
Hard Instances of Algorithms and Proof Systems
Rod Downey.
Randomness, Computation and Mathematics
Stefano Mazzanti.
Bases for AC0 and other Complexity Classes
Vincent Ardourel and Julie Jebeile.
Cellular Automata Simulations: Are They Really of a Special Kind?
Jürgen Dassow, Florin Manea and Robert Mercas.
Connecting Partial Words and Regular Languages
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
Kenshi Miyabe.
An integral test for Schnorr randomness and its applications
Franck Delaplace, Hanna Klaudel, Tarek Melliti and Sylvain Sené.
Analysis of modular organisation of interaction networks based on asymptotic dynamics
David FernC!ndez and Joost Joosten.
Turing Progressions and their wellorders
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.
Multiscale modeling of gene regulation of morphogenesis
Anton Konovalov and Victor Selivanov.
Boolean Algebras of Regular $\omega$Languages
Amin Farjudian.
A Semantic Framework for Real Computation with Polynomial Enclosures
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 lambdaequality
Stephane Massonet.
Turing and Wittgenstein : from the Foundations of Mathematics to Intelligent machines
KenIchi Hiraga, Kota Ikeda and Takashi Miura.
Slow and steady wins the race: relationship between accuracy and speed of Turing pattern formation
Martin Huschenbett.
Word Automaticity of Tree Automatic Scattered Linear Orderings Is Decidable
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 Polynomialtime 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 $5no(n)$ Lower Bound on the Circuit Size over $U_2$ of a Linear Boolean Function
Bastien Le Gloannec and Nicolas Ollinger.
Substitutions and Strongly Deterministic Tilesets
Les Hatton.
Equilibriation of information in software systems
Makoto Fujiwara, Kojiro Higuchi and Takayuki Kihara.
Recursive marriage theorems and reverse mathematics
Armando Matos and Andreia Teixeira.
Lossless compressors: Degree of compression and optimality
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 nonlocal games
Filip Mazowiecki.
Continuous reductions of regular languages
Sam Sanders.
Nonstandard Analysis: A New Way to Compute
Matthew Szudzik.
Is Turing's Thesis the Consequence of a More General Physical Principle?
Andreas Weiermann and Alan Woods.
Some natural zero one laws for ordinals below $\varepsilon_0$
Szilard Zsolt Fazekas, Robert Mercas and Kayoko ShikishimaTsuji.
Palindromic completion, a basis for hairpin completion
Ray Dougherty.
Turing Machines Expressed as Chomsky Grammars in the Computational Universe: A Linguistic Complexity Metric
Ludwig Staiger.
A Correspondence Priciple for Exact Constructive Dimension
Simon Perdrix.
A Lower Bound on the Minimal Resources for Measurementbased Quantum Computation
Lars Kristiansen.
Degrees of Total Algorithms versus Degrees of Honest Functions
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
Eric Allender.
Curiouser and Curiouser: The Link between Incompressibility and Complexity
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
Paul Smolensky.
Subsymbolic Computation Theory for the Human Intuitive Processor
Roussanka Loukanova.
Computational SyntaxSemantics 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
Arno Pauly.
Multivalued functions in Computability Theory
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 QREDUCIBILITY
Chengling Fang, Shenling Wang and Guohua Wu.
Highness and Local Noncappability
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 MartinLöf random Sets
Robert Rettinger.
Compactness and the Effectivity of Uniformization
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 ThreeDimensional ReactionDiffusion 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
Mike Stannett and Marian Gheorghe.
Using Topological Spaces to Control P Systems
Di Cai and Lee McCluskey.
A simple method for estimating term mutual information
Sorin Istrail and Solomon Marcus.
Turing and von Neumannb SakalauskaitDs Brains and their Computers
Alexander Shen.
Game arguments in computability theory and algorithmic information theory
Pierre Guillon and Charalampos Zinoviadis.
Densities and entropies in cellular automata
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 nonmaximal prefixfree complexity.
Mikhail Peretyatkin.
On the TarskiLindenbaum algebra of the class of all strongly constructivizable prime models
Amos Golan.
On the Foundations and Philosophy of InfoMetrics
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
Sori Lee.
Trees for Subtoposes of the Effective Topos
Assel Altayeva and Iman Poernomo.
Towards a Type Theory of Predictable Assembly
Anupam Das.
Complexity of Deep Inference via Flow Graphs
S. G. Sterrett.
Bringing Up Turing's ChildMachine
Bruce Edmonds and Carlos Gershenson.
Learning, Social Intelligence and the Turing Test  why an 'outofthebox' Turing Machine will not pass the Turing Test
Ralph Wojtowicz, Selmer Bringsjord and John Hummel.
Dynamic Semantics of TauN Theories
Francis Rousseaux, Alain Bonardi and Antoine Vincent.
Collectioncentred Analysis and Design: Because We Should Not Have to Choose between Ludus and Paidia while Building our Interactive AI Systems
ChungChih Li.
Is the Trilogy of Gap, Compression, and Honesty Theorems Still Significant at Type2?
Aliakbar Safilian and Farzad Didehvar.
Two New Reducibilities Based on Enumeration Orders
Merlin Carl.
The distribution of the ITRMrecognizable reals
Stephen Flood.
Reverse mathematics and a packed Ramsey's theorem.
Ivor GrattanGuinness.
On mathematicians who liked logic: the case of Max Newman
Martin Lackner.
Permutation Pattern Matching and its Parameterized Complexity
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
Shannon Bohle.
Virtual Worlds as Portals for Information Discovery
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
Ekaterina Fokina and Pavel Semukhin.
Structures presentable by various types of automata
Eugene Postnikov.
Computational model based on meteorological data for forecast of influenzalike activity
Andrey Sariev.
The OmegaTuring 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
Dirk Sudholt.
The Analysis of Evolutionary Algorithms: Why Evolution is Faster With Crossover
Laurentiu Leustean and Ulrich Kohlenbach.
Applications of proof mining in nonlinear ergodic theory
Magnus Gausdal Find and Joan Boyar.
Cancellationfree circuits: An approach for proving superlinear lower bounds for linear Boolean operators
Martin Adamcik.
Collective Reasoning under Uncertainty and Inconsistency
Peter Wegner.
Alan Turing and Maurice Wilkes
Hristo Ganchev.
The enumeration degrees of semirecursive sets
Catherine Stinson.
Computational Models as Mechanistic Explanations
Michael Olinick.
An Undergraduate Course on the Life and Work of Alan Turing
Yun Shang, Xian Lu and Ruqian Lu.
Closure Properties of Quantum Turing Languages
Sergei Podzorov.
Computable Cclasses
Hideki Tsuiki.
MultiHead Extension of the Turing Machine for Computation over Continuous Spaces
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 ChamorroPosada.
Distributed computation in inertial frames
Pieter Adriaans.
Facticity as the amount of selfdescriptive information in a data set
Marcin J. Schroeder.
Structural versus Quantitative Characteristics of Information in Information Processing: Information Integration
Loizos Michael.
WebSense: Making Sense of the Web
Yoshihiro Maruyama.
Categorical Universal Logic: Duality as Semantics
Benjamin Rin.
The computational strengths of alphalength infinite time Turing machines
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ándezQuiroz and Pablo PadillaLongoria.
Some constraints on the physical realizability of a mathematical construction
Jiamou Liu.
An Automata Model for Computations Over an Arbitrary Structure
= invited paper
= contributed paper
= informal presentation
Please send queries/amendements for this list to: Barry Cooper pmt6sbc @ leeds.ac.uk

