Models of Computation in Context: 7th Conference on Computability in Europe, CiE 2011, Sofia, Bulgaria, June 27 - July 2, 2011. Proceedings

330 Pages·2011·4.22 MB·English

by  Pablo Arrighi

Lecture Notes in Computer Science 6735
CommencedPublicationin1973
FoundingandFormerSeriesEditors:
GerhardGoos,JurisHartmanis,andJanvanLeeuwen
EditorialBoard
DavidHutchison
LancasterUniversity,UK
TakeoKanade
CarnegieMellonUniversity,Pittsburgh,PA,USA
JosefKittler
UniversityofSurrey,Guildford,UK
JonM.Kleinberg
CornellUniversity,Ithaca,NY,USA
AlfredKobsa
UniversityofCalifornia,Irvine,CA,USA
FriedemannMattern
ETHZurich,Switzerland
JohnC.Mitchell
StanfordUniversity,CA,USA
MoniNaor
WeizmannInstituteofScience,Rehovot,Israel
OscarNierstrasz
UniversityofBern,Switzerland
C.PanduRangan
IndianInstituteofTechnology,Madras,India
BernhardSteffen
TUDortmundUniversity,Germany
MadhuSudan
MicrosoftResearch,Cambridge,MA,USA
DemetriTerzopoulos
UniversityofCalifornia,LosAngeles,CA,USA
DougTygar
UniversityofCalifornia,Berkeley,CA,USA
GerhardWeikum
MaxPlanckInstituteforInformatics,Saarbruecken,Germany
Benedikt Löwe
Dag Normann
Ivan Soskov
Alexandra Soskova (Eds.)
Models
of Computation
in Context
7th Conference on Computability in Europe, CiE 2011
Sofia, Bulgaria, June 27 - July 2, 2011
Proceedings
1 3
VolumeEditors
BenediktLöwe
UniversityofAmsterdam
InstituteforLogic,LanguageandComputation
P.O.Box94242
1090GEAmsterdam,TheNetherlands
E-mail:[email protected]
DagNormann
UniversityofOslo
DepartmentofMathematics
P.O.Box1053Blindern
0316Oslo,Norway
E-mail:[email protected]
IvanSoskov
SofiaUniversity
FacultyofMathematicsandInformatics
DepartmentofMathematicalLogicandApplications
5JamesBourchierblvd.
1164Sofia,Bulgaria
E-mail:[email protected]fia.bg
AlexandraSoskova
SofiaUniversity
FacultyofMathematicsandInformatics
DepartmentofMathematicalLogicandApplications
5JamesBourchierblvd.
1164Sofia,Bulgaria
E-mail:[email protected]fia.bg
ISSN0302-9743 e-ISSN1611-3349
ISBN978-3-642-21874-3 e-ISBN978-3-642-21875-0
DOI10.1007/978-3-642-21875-0
SpringerHeidelbergDordrechtLondonNewYork
LibraryofCongressControlNumber:2011930187
CRSubjectClassification(1998):F.2,F.1,G.2,I.1
LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues
©Springer-VerlagBerlinHeidelberg2011
Thisworkissubjecttocopyright.Allrightsarereserved,whetherthewholeorpartofthematerialis
concerned,specificallytherightsoftranslation,reprinting,re-useofillustrations,recitation,broadcasting,
reproductiononmicrofilmsorinanyotherway,andstorageindatabanks.Duplicationofthispublication
orpartsthereofispermittedonlyundertheprovisionsoftheGermanCopyrightLawofSeptember9,1965,
initscurrentversion,andpermissionforusemustalwaysbeobtainedfromSpringer.Violationsareliable
toprosecutionundertheGermanCopyrightLaw.
Theuseofgeneraldescriptivenames,registerednames,trademarks,etc.inthispublicationdoesnotimply,
evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevantprotectivelaws
andregulationsandthereforefreeforgeneraluse.
Typesetting:Camera-readybyauthor,dataconversionbyScientificPublishingServices,Chennai,India
Printedonacid-freepaper
SpringerispartofSpringerScience+BusinessMedia(www.springer.com)
Preface
CiE 2011: Models of Computation in Context
Sofia, Bulgaria, June 27 – July 2, 2011
CiE 2011 was the seventh meeting in the conference series “Computability
in Europe” and the third meeting after the foundation of the Association CiE
in Athens 2008. Both the conference series and the association promote the
development of computability-related science, ranging over mathematics, com-
puter science and applications in various natural and engineering sciences such
asphysicsandbiology,andalsoincludingthepromotionofrelatednon-scientific
fieldssuchasphilosophyandhistoryofcomputing.Thetitleandtopicofthesev-
enthconference,Models of Computation in Context,highlightsthetwopillarson
whichtheCiEmovementrests:themathematicalrepresentationofcomputation
as a tool for understanding computability, and its application and adaptation
to various real-world contexts. This conference was held at Sofia University in
Bulgaria.
ThefirstsixoftheCiEconferenceswereheldattheUniversityofAmsterdam
in 2005, at the University of Wales Swansea in 2006, at the University of Siena
in 2007, at the University of Athens in 2008, at the University of Heidelberg
in 2009 and at the University of the Azores in 2010. The proceedings of these
meetings, edited in 2005 by S. Barry Cooper, Benedikt Lo¨we and Leen Toren-
vliet, in 2006 by Arnold Beckmann, Ulrich Berger, Benedikt Lo¨we and John V.
Tucker, in 2007 by S. Barry Cooper, Benedikt Lo¨we and Andrea Sorbi, in 2008
by Arnold Beckmann, Costas Dimitracopoulos and Benedikt Lo¨we, in 2009 by
Klaus Ambos-Spies, Benedikt Lo¨we and Wolfgang Merkle and in 2010 by Fer-
nando Ferreira, Benedikt Lo¨we, Elvira Mayordomo and Lu´ıs Mendes Gomes,
were published as Springer Lecture Notes in Computer Science, Volumes 3526,
3988, 4497,5028, 5365 and 6158, respectively.
CiE and its conferences have changed our perceptions of computability and
itsinterfacewithotherareasofknowledge.Thelargenumberofmathematicians
andcomputerscientistsattendingthoseconferencehadtheirviewofcomputabil-
ity theory enlarged and transformed:They discoveredthat its foundations were
deeper and more mysterious, its technical development more vigorous, its ap-
plications wider and more challenging than they had known. The annual CiE
VI Preface
conference has become a major event, and is the largest international meeting
focused on computability theoretic issues. Future meetings are in the planning.
The meeting in2012willbe in Cambridge,UK,andwillbe a partofthe Turing
Centenary Celebrations. The series is coordinated by the CiE Conference Se-
ries Steering Committee consisting of Lu´ıs Antunes (Porto, Secretary), Arnold
Beckmann (Swansea), Paola Bonizzoni (Milano), S. Barry Cooper (Leeds), Viv
Kendon(Leeds),BenediktLo¨we(Amsterdam,Chair),DagNormann(Oslo),and
Peter van Emde Boas (Amsterdam).
The conference was based on invited tutorials and lectures, and a set of spe-
cial sessions on a range of subjects; there were also many contributed papers
and informal presentations. This volume contains 11 of the invited lectures and
under40%ofthesubmitted contributedpapers,allofwhichhavebeenrefereed.
The Best Student Paper Award was given to Stefan Vatev for his paper “Con-
servative Extensions of AbstractStructures.” We thank Springer for sponsoring
this award.
Jack Lutz (Iowa State University) and Geoffrey Pullum (University of Ed-
inburgh) were the tutorial speakers. The conference had the following invited
speakers: Christel Baier (Dresden), Michiel van Lambalgen (Amsterdam), An-
tonioMontalban(Chicago),AlexandraShlapentokh(Greenville),TheodoreSla-
man(Berkeley),JanetThornton(Cambridge)andAlasdairUrquhart(Toronto).
CiE 20ll had six special sessions:
Computability in Analysis, Algebra, and Geometry.
Organizers.AlexandraShlapentokh(Greenville)andDieterSpreen(Siegen).
Speakers. Ulrich Berger, Vasco Brattka, Valentina Harizanov and Russell
Miller.
Classical Computability Theory.
Organizers. Douglas Cenzer (Gainesville) and Bjørn Kjos-Hanssen (Hon-
olulu).
Speakers. Mingzhong Cai, Rachel Epstein, Charles Harris and Guohua Wu.
Natural Computing.
Organizers. Erz´ebet Csuhaj-Varju´ (Budapest) and Ion Petre (Turku).
Speakers. Natalio Krasnogor, Martin Kutrib, Victor Mitrana and Agust´ın
Riscos-Nu´n˜ez.
Relations Between the Physical World and Formal Models of
Computability.
Organizers. Viv Kendon (Leeds) and Sonja Smets (Groningen).
Speakers.PabloArrighi,CˇaslavBrukner,ElhamKashefiandPrakashPanan-
gaden.
Theory of Transfinite Computations.
Organizers. Peter Koepke (Bonn) and Chi Tat Chong (Singapore).
Speakers. Merlin Carl, Sy D. Friedman, Wei Wang and Philip Welch.
Computational Linguistics.
Organizers. Tejaswini Deoskar (Amsterdam) and Tinko Tinchev (Sofia).
Speakers. Klaus U. Schulz, Ian Pratt-Hartmann and Robin Cooper.
Preface VII
TheCiE2011conferencewasorganisedbyDouglasCenzer(Gainesville),An-
gelDichev(Sofia),DamirDzhafarov(Chicago),HristoGanchev(Sofia),Dimitar
Guelev (Sofia), Vladislav Nenchev (Sofia), Stela Nikolova (Sofia), Dimitar Shi-
achki (Sofia), Alexandra Soskova (Chair, Sofia), Mariya Soskova (Sofia), Stefan
Vatev (Sofia), Mitko Yanchev (Sofia) and Anton Zinoviev (Sofia).
Wearehappyandthankfultoacknowledgethegeneroussupportofthefollow-
ingsponsors:TheNationalScienceFoundation(USA),theAssociationforSym-
bolicLogic,the EuropeanMathematicalSociety,the EuropeanSocialFund,the
Bulgarian National Science Fund, the Bulgarian Ministry of Education, Youth
and Science, the company Partners 1993, the publisher Elsevier B.V., and the
company Opencode Mobile Network Systems. Special thanks are due to the fol-
lowing sponsors who supported this volume: The Haemimont Foundation (a
corporation engaged in not-for-profit activities for the public good, especically
in the area of education), and Astea Solutions (a custom software development
company which—in collaborationwith The Andrew W. Mellon Foundation and
the University of Southern California—has developed Sophie, an open source,
electronic authoring, reading, and publishing set of tools).
The high scientific quality of the conference was possible through the con-
scientious work of the Programme Committee, the special session organizers
and the referees. We are grateful to all members of the Programme Committee
for their efficient evaluations and extensive debates, which established the final
programme, and we also thank the referees.
We thank Andrej Voronkov for his EasyChair system which facilitated the
work of the Programme Committee and the editors considerably.
April 2011 Benedikt Lo¨we
Dag Normann
Ivan Soskov
Alexandra Soskova
Organization
Programme Committee
Selim Akl, Kingston Phokion Kolaitis, Santa Cruz
Albert Atserias, Barcelona Benedikt Lo¨we, Amsterdam
Anthony Beavers,Evansville Elvira Mayordomo,Zaragoza
Arnold Beckmann, Swansea Dag Normann(Chair), Oslo
Paola Bonizzoni, Milan Jan-Willem Romeijn, Groningen
Anne Condon, Vancouver Marie-France Sagot, Lyon
Thierry Coquand, Gothenburg Dirk Schlimm, Montreal
Anuj Dawar, Cambridge Tony Seda, Cork
Fernando Ferreira, Lisbon Nir Shavit, Tel Aviv
Denis Hirschfeldt, Chicago Ivan Soskov(Chair),Sofia
Radha Jagadeesan,Chicago Alexandra Soskova,Sofia
Neil Jones, Copenhagen Sarah Teichmann, Cambridge
Natasha Jonoska, New York Peter Van Emde Boas, Amsterdam
Achim Jung, Birmingham Jan Van Leeuwen, Utrecht
Viv Kendon, Leeds Klaus Wagner, Wu¨rzburg
Julia Knight, Notre Dame Andreas Weiermann, Ghent
List of Referees
Allender, Eric Lubarsky, Robert
Baixeries, Jaume Miller, Joseph
Bernardinello, Luca Montalban, Antonio
Brattka, Vasco Murlak, Filip
Buhrman, Harry Ng, Keng Meng
Busic, Ana Nguyen, Phuong
Buss, Sam Nordstrom, Bengt
Carpi, Arturo Pauly, Arno
Dassow, Ju¨rgen Polyzotis, Neoklis
De Miguel Casado, Gregorio Rettinger, Robert
Deonarine, Andrew Schlage-Puchta,Jan-Christoph
Deoskar, Tejaswini Solomon, Reed
Fermu¨ller, Chris Soskova, Mariya
Fernandes, Anto´nio Sterkenburg, Tom
Franco, Giuditta Stukachev, Alexey
Fuhr, Norbert ten Cate, Balder
Gierasimczuk, Nina Van Gasse, Bart
Kalimullin, Iskander Vereshchagin, Nikolai
Ko¨tzing, Timo Weller, Daniel
Lempp, Steffen Yunes, Jean-Baptiste
Lewis, Andrew Zandron, Claudio
Table of Contents
Applying Causality Principles to the Axiomatization of Probabilistic
Cellular Automata ............................................... 1
Pablo Arrighi, Renan Fargetton, Vincent Nesme, and Eric Thierry
Three Theorems on n-REA Degrees: Proof-Readers and Verifiers....... 11
Mingzhong Cai
A Computational Approach to an Alternative Working Environment
for the Constructible Universe ..................................... 21
Merlin Carl
Automatic Learners with Feedback Queries.......................... 31
John Case, Sanjay Jain, Yuh Shin Ong, Pavel Semukhin, and
Frank Stephan
Splicing Systems: Accepting versus Generating....................... 41
Juan Castellanos, Victor Mitrana, and Eugenio Santos
Effective Categoricity of Injection Structures ........................ 51
Douglas Cenzer, Valentina Harizanov, and Jeffrey B. Remmel
Consistency and Optimality ....................................... 61
Yijia Chen, Jo¨rg Flum, and Moritz Mu¨ller
Cupping and Diamond Embeddings: A Unifying Approach ............ 71
Chengling Fang, Jiang Liu, and Guohua Wu
On the KolmogorovComplexity of Continuous Real Functions......... 81
Amin Farjudian
Defining Languages by Forbidding-Enforcing Systems................. 92
Daniela Genova
Axiomatizing Resource Bounds for Measure ......................... 102
Xiaoyang Gu, Jack H. Lutz, Satyadev Nandakumar, and
James S. Royer
Complexity Issues for Preorders on Finite Labeled Forests............. 112
Peter Hertling and Victor Selivanov
Randomness and the Ergodic Decomposition ........................ 122
Mathieu Hoyrup
XII Table of Contents
Computability of the Radon-Nikodym Derivative..................... 132
Mathieu Hoyrup, Cristo´bal Rojas, and Klaus Weihrauch
Extracting Winning Strategies in Update Games..................... 142
Imran Khaliq, Bakhadyr Khoussainov, and Jiamou Liu
A Generalised Dynamical System, Infinite Time Register Machines,
and Π1-CA ..................................................... 152
1 0
Peter Koepke and Philip D. Welch
Computability Power of Mobility in Enhanced Mobile Membranes...... 160
Shankara Narayanan Krishna and Gabriel Ciobanu
Nature-Based Problems in Cellular Automata ....................... 171
Martin Kutrib
Multi-Resolution Cellular Automata for Real Computation............ 181
James I. Lathrop, Jack H. Lutz, and Brian Patterson
Deciding According to the Shortest Computations.................... 191
Florin Manea
Computation of Similarity—Similarity Search as Computation......... 201
Stoyan Mihov and Klaus U. Schulz
Adapting Rabin’s Theorem for Differential Fields .................... 211
Russell Miller and Alexey Ovchinnikov
Quantum Information Channels in Curved Spacetime................. 221
Prakash Panangaden
Recognizing Synchronizing Automata with Finitely Many Minimal
Synchronizing Words is PSPACE-Complete ......................... 230
Elena V. Pribavkina and Emanuele Rodaro
Consecutive Ones Property Testing: Cut or Swap .................... 239
Mathieu Raffinot
Current Developments on Computational Modeling Using P Systems ... 250
Agust´ın Riscos-Nu´n˜ez
Automata on Ordinals and Linear Orders ........................... 252
Philipp Schlicht and Frank Stephan
A Fine Hierarchy of ω-Regular k-Partitions.......................... 260
Victor Selivanov
On a Relative Computability Notion for Real Functions............... 270
Dimiter Skordev and Ivan Georgiev