Theory and Applications of Computability

Total Page:16

File Type:pdf, Size:1020Kb

Theory and Applications of Computability Theory and Applications of Computability In cooperation with the association Computability in Europe Series editors Laurent Bienvenu Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier (LIRMM) Montpellier France [email protected] Paola Bonizzoni Università degli Studi di Milano-Bicocca Dipartimento di Informatica Sistemistica e Comunicazione (DISCo) Milano Italy [email protected] Vasco Brattka Universität der Bundeswehr München Fakultät für Informatik Neubiberg Germany University of Cape Town Department of Mathematics & Applied Mathematics Rondebosch South Africa [email protected] Elvira Mayordomo Universidad de Zaragoza Departamento de Informática e Ingeniería de Sistemas Zaragoza Spain [email protected] Prakash Panangaden McGill University School of Computer Science Montreal Canada [email protected] Founding Editors: P. Bonizzoni, V. Brattka, S.B. Cooper, E. Mayordomo Books published in this series will be of interest to the research community and graduate students, with a unique focus on issues of computability. The perspective of the series is multidisciplinary, recapturing the spirit of Turing by linking theoretical and real-world concerns from computer science, mathematics, biology, physics, and the philosophy of science. The series includes research monographs, advanced and graduate texts, and books that offer an original and informative view of computability and computational paradigms. Series Advisory Board Samson Abramsky, University of Oxford Eric Allender, Rutgers, The State University of New Jersey Klaus Ambos-Spies, Universität Heidelberg Giorgio Ausiello, Università di Roma, “La Sapienza” Jeremy Avigad, Carnegie Mellon University Samuel R. Buss, University of California, San Diego Rodney G. Downey, Victoria University of Wellington Sergei S. Goncharov, Novosibirsk State University Peter Jeavons, University of Oxford Nataša Jonoska, University of South Florida, Tampa Ulrich Kohlenbach, Technische Universität Darmstadt Ming Li, University of Waterloo Wolfgang Maass, Technische Universität Graz Grzegorz Rozenberg, Leiden University and University of Colorado, Boulder Alan Selman, University at Buffalo, The State University of New York Wilfried Sieg, Carnegie Mellon University Jan van Leeuwen, Universiteit Utrecht Klaus Weihrauch, FernUniversität Hagen Philip Welch, University of Bristol More information about this series at http://www.springer.com/series/8819 S. Barry Cooper • Mariya I. Soskova Editors The Incomputable Journeys Beyond the Turing Barrier 123 Editors S. Barry Cooper Mariya I. Soskova School of Mathematics Dept. of Mathematical Logic University of Leeds & Applications Leeds, United Kingdom Sofia University Sofia, Bulgaria ISSN 2190-619X ISSN 2190-6203 (electronic) Theory and Applications of Computability ISBN 978-3-319-43667-8 ISBN 978-3-319-43669-2 (eBook) DOI 10.1007/978-3-319-43669-2 Library of Congress Control Number: 2016956098 © Springer International Publishing AG 2017 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations. Printed on acid-free paper This Springer imprint is published by Springer Nature The registered company is Springer International Publishing AG The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland Preface As coeditor, I would like to express my very great appreciation to a number of individuals and institutions who supported this project throughout its development. The event that gave rise to this book would not have come to be without the practical and financial support of the Isaac Newton Institute and their staff and the funding from the John Templeton Foundation. The Chicheley Hall International Centre and its Royal Society staff were magnificent in providing the right atmosphere for the workshop. And the remarkable participants were the ones who made the event such an exciting one. I am grateful to Springer and the editorial board of the book series “Theory and Applications of Computability”, who accepted our idea for this book with no hesitation and supported us throughout its development. Ronan Nugent’s advice and encouragement is deeply appreciated and was especially needed during the final stages of this project. I thank all contributors to this book for their diligent work and patience; the numerous reviewers for their valuable suggestions, comments and questions; the Sofia University Science Foundation and the programme “Women in Science” for their financial support; and my husband Joe Miller and my mother Alexandra Soskova for their unwavering moral support. Most of all, I would like to thank Barry Cooper for including me in this great adventure. Madison, WI, USA Mariya I. Soskova 28 March 2016 v Contents Introduction ...................................................................... 1 Mariya I. Soskova Part I Challenging Turing: Extended Models of Computation Ivan Soskov: A Life in Computability ......................................... 11 Hristo Ganchev and Dimiter Skordev Physical Logic .................................................................... 47 Kate Clements, Fay Dowker, and Petros Wallden From Quantum Foundations via Natural Language Meaning toaTheoryofEverything....................................................... 63 Bob Coecke Part II The Search for “Natural” Examples of Incomputable Objects Some Recent Research Directions in the Computably Enumerable Sets ................................................................. 83 Peter A. Cholak Uncomputability and Physical Law ............................................ 95 Seth Lloyd Algorithmic Economics: Incomputability, Undecidability and Unsolvability in Economics ................................................ 105 K. Vela Velupillai Part III Mind, Matter and Computation Is Quantum Physics Relevant for Life? ........................................ 123 Vlatko Vedral vii viii Contents Trouble with Computation: A Refutation of Digital Ontology.............. 133 J. Mark Bishop Part IV The Nature of Information: Complexity and Randomness Complexity Barriers as Independence ......................................... 143 Antonina Kolokolova Quantum Randomness: From Practice to Theory and Back................ 169 Cristian S. Calude Calculus of Cost Functions ...................................................... 183 André Nies Part V The Mathematics of Emergence and Morphogenesis Turing’s Theory of Morphogenesis: Where We Started, Where WeAreandWhereWeWanttoGo............................................ 219 Thomas E. Woolley, Ruth E. Baker, and Philip K. Maini Construction Kits for Biological Evolution.................................... 237 Aaron Sloman Contributors Ruth E. Baker Wolfson Centre for Mathematical Biology, Mathematical Institute, University of Oxford, Oxford, UK J. Mark Bishop Goldsmiths, University of London, London, UK Cristian S. Calude Department of Computer Science, University of Auckland, Auckland, New Zealand Peter A. Cholak Department of Mathematics, University of Notre Dame, Notre Dame, IN, USA Kate Clements Blackett Laboratory, Imperial College, London, UK Bob Coecke University of Oxford, Oxford, UK Fay Dowker Blackett Laboratory, Imperial College, London, UK Perimeter Institute, Waterloo, ON, Canada Institute for Quantum Computing, University of Waterloo, Waterloo, ON, Canada Hristo Ganchev Faculty of Mathematics and Informatics, Sofia University, Sofia, Bulgaria Antonina Kolokolova Department of Computer Science, Memorial University of Newfoundland, St. John’s, NL, Canada Seth Lloyd Mechanical Engineering, Massachusetts Institute of Technology, Cambridge, MA, USA Philip K. Maini Wolfson Centre for Mathematical Biology, Mathematical Insti- tute, University of Oxford, Oxford, UK André Nies Department of Computer Science, University of Auckland, Auckland, New Zealand ix x Contributors Dimiter Skordev Faculty of Mathematics and Informatics, Sofia University, Sofia, Bulgaria Aaron Sloman School of Computer Science, University of Birmingham, Birmingham, UK Mariya I. Soskova Department of Mathematical Logic and Applications, Sofia University, Sofia, Bulgaria Vlatko Vedral Department of Physics, Clarendon Laboratory, University of Ox- ford, Oxford, UK Centre for Quantum Technologies, National University of Singapore, Singapore, Singapore Department of Physics, National University of Singapore, Singapore, Singapore Center for Quantum Information, Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing, China K. Vela Velupillai Madras School of Economics, Chennai, India Petros Wallden School of Informatics, University of Edinburgh, Edinburgh, UK IPaQS, Heriot-Watt University, Edinburgh, UK Thomas E. Woolley Wolfson Centre for Mathematical Biology, Mathematical Institute, University of Oxford, Oxford, UK.
Recommended publications
  • Volume 16, Number 1
    2 International Journal "Information Theories & Applications" Vol.16 / 2009 International Journal INFORMATION THEORIES & APPLICATIONS Volume 16 / 2009, Number 1 Editor in chief: Krassimir Markov (Bulgaria) International Editorial Staff Chairman: Victor Gladun (Ukraine) Adil Timofeev (Russia) Ilia Mitov (Bulgaria) Aleksey Voloshin (Ukraine) Juan Castellanos (Spain) Alexander Eremeev (Russia) Koen Vanhoof (Belgium) Alexander Kleshchev (Russia) Levon Aslanyan (Armenia) Alexander Palagin (Ukraine) Luis F. de Mingo (Spain) Alfredo Milani (Italy) Nikolay Zagoruiko (Russia) Anatoliy Krissilov (Ukraine) Peter Stanchev (Bulgaria) Anatoliy Shevchenko (Ukraine) Rumyana Kirkova (Bulgaria) Arkadij Zakrevskij (Belarus) Stefan Dodunekov (Bulgaria) Avram Eskenazi (Bulgaria) Tatyana Gavrilova (Russia) Boris Fedunov (Russia) Vasil Sgurev (Bulgaria) Constantine Gaindric (Moldavia) Vitaliy Lozovskiy (Ukraine) Eugenia Velikova-Bandova (Bulgaria) Vitaliy Velichko (Ukraine) Galina Rybina (Russia) Vladimir Donchenko (Ukraine) Gennady Lbov (Russia) Vladimir Jotsov (Bulgaria) Georgi Gluhchev (Bulgaria) Vladimir Lovitskii (GB) IJ ITA is official publisher of the scientific papers of the members of the ITHEA® International Scientific Society IJ ITA welcomes scientific papers connected with any information theory or its application. IJ ITA rules for preparing the manuscripts are compulsory. The rules for the papers for IJ ITA as well as the subscription fees are given on www.ithea.org . The camera-ready copy of the paper should be received by http://ij.ithea.org. Responsibility for papers published in IJ ITA belongs to authors. General Sponsor of IJ ITA is the Consortium FOI Bulgaria (www.foibg.com). International Journal “INFORMATION THEORIES & APPLICATIONS” Vol.16, Number 1, 2009 Printed in Bulgaria Edited by the Institute of Information Theories and Applications FOI ITHEA®, Bulgaria, in collaboration with the V.M.Glushkov Institute of Cybernetics of NAS, Ukraine, and the Institute of Mathematics and Informatics, BAS, Bulgaria.
    [Show full text]
  • New Computational Paradigmsnew Computational Paradigms
    Lecture Notes in Computer Science 3526 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen University of Dortmund, Germany Madhu Sudan Massachusetts Institute of Technology, MA, USA Demetri Terzopoulos New York University, NY, USA Doug Tygar University of California, Berkeley, CA, USA Moshe Y. Vardi Rice University, Houston, TX, USA Gerhard Weikum Max-Planck Institute of Computer Science, Saarbruecken, Germany S. Barry Cooper Benedikt Löwe Leen Torenvliet (Eds.) New Computational Paradigms First Conference on Computability in Europe, CiE 2005 Amsterdam, The Netherlands, June 8-12, 2005 Proceedings 13 Volume Editors S. Barry Cooper University of Leeds School of Mathematics Leeds, LS2 9JT, UK E-mail: [email protected] Benedikt Löwe Leen Torenvliet Universiteit van Amsterdam Institute for Logic, Language and Computation Plantage Muidergracht 24, 1018 TV Amsterdam, NL E-mail: {bloewe,leen}@science.uva.nl Library of Congress Control Number: 2005926498 CR Subject Classification (1998): F.1.1-2, F.2.1-2, F.4.1, G.1.0, I.2.6, J.3 ISSN 0302-9743 ISBN-10 3-540-26179-6 Springer Berlin Heidelberg New York ISBN-13 978-3-540-26179-7 Springer Berlin Heidelberg New York This work is subject to copyright.
    [Show full text]
  • Computability and Complexity in Analysis Schloß Dagstuhl, November 11–16, 2001
    Dagstuhl-Seminar 01461 on Computability and Complexity in Analysis Schloß Dagstuhl, November 11–16, 2001 Organizers: Vasco Brattka (Hagen), Peter Hertling (Hagen), Mariko Yasugi (Kyoto), Ning Zhong (Cincinnati). Preface This meeting was the third Dagstuhl seminar which was concerned with the theory of computability and complexity over the real numbers. This theory, which is built on the Turing machine model, was initiated by Turing, Grzegorczyk, Lacombe, Banach and Mazur, and has seen a rapid growth in recent years. Recent monographs are by Pour- El/Richards, Ko, and Weihrauch. Computability theory and complexity theory are two central areas of research in the- oretical computer science. Until recently, most work in these areas concentrated on prob- lems over discrete structures. In the last years, though, there has been an enormous growth of computability theory and complexity theory over the real numbers and other continuous structures. One of the reasons for this phenomenon is that more and more practical computation problems over the real numbers are being dealt with by computer scientists, for example, in computational geometry, in the modelling of dynamical and hybrid systems, but also in classical problems from numerical mathematics. The scien- tists working on these questions come from different fields, such as theoretical computer science, domain theory, logic, constructive mathematics, computer arithmetic, numerical mathematics, analysis etc. This Dagstuhl seminar provided a unique opportunity for 46 participants from such diverse areas and 12 different countries to meet and exchange ideas and knowledge. One of the topics of interest was foundational work concerning the various models and approaches for defining or describing computability and complexity over the real numbers.
    [Show full text]
  • Curriculum Vitae
    Roussanka Loukanova Curriculum Vitae Roussanka Loukanova September 30, 2021 Contents I CV R´esum´e3 1 Education and Degrees3 2 Academic Qualification4 3 Pedagogic Training4 4 Employment and Association4 4.1 Present...........................................4 4.2 Former Positions......................................4 4.3 Visiting Positions and Fellowships............................5 II Scientific Profile6 5 Expertise 6 6 Experience with Software Packages7 III Pedagogic Profile7 7 Experience in Teaching7 7.1 Courses Taught and Developed..............................8 8 Experience as a Supervisor9 8.1 Supervision of Bachelor and Master's Theses......................9 8.2 Supervision of Ph.D. Students...............................9 8.3 Participation in Evaluation Committees of M.Sc. and Ph.D. Theses.........9 9 Training in Teaching and Learning in Higher Education9 10 Some Pedagogical Work and Teaching Materials 10 IV Grants 10 V Scholarly Activities 13 1 / 27 Roussanka Loukanova 11 Scientific Organizations, Committees 13 11.1 Organization Committees................................. 13 11.2 Reviewing and Member of Program Committees.................... 15 11.2.1 Area Supervisory Committee........................... 15 11.2.2 Program Committees............................... 15 12 Other International Engagements 16 12.1 Tutorials........................................... 16 12.2 Some Conference and Seminar Participation, Talks, Presentations........... 16 VI Scientific Works 18 13 Work in Progress 18 14 List of Publications 19 14.1 Publications
    [Show full text]
  • CCA 2018 Abstract Booklet
    Conference Programme The conference takes place at Georg-von-Vollmar Academy Schloss Aspenstein Am Aspensteinbichl 9-11 82431 Kochel am See Bavaria, Germany Phone: +49 8851 780 Fax: +49 8851 7823 Sunday, August the 5th 14:15 Opening 14:30 Florian Steinberg (Invited Talk) A simple universal machine of type two and a formal proof of its correctness 15:30 Coffee Break 16:00 Michal Konecný Verified exact real limit computation 16:30 Franz Brauße, Norbert Müller, and Robert Rettinger Intensionality and multi-valued limits 17:00 Eike Neumann On the computability of the Fréchet distance of surfaces in the bit-model of real computation 17:30 Chansu Park Tensor calculus in exact real computation - From recursive analysis to abstract data types: a case study 18:00 Dinner Monday, August the 6th 08:00 Breakfast 09:00 Daniel Graça (Invited Talk) Computing the asymptotic behavior of continuous-time dynamical systems 10:00 Coffee Break 10:30 Diogo Poças (Invited Talk) Analog computability with differential equations 11:30 Christoph Spandl Computable series expansions in celestial mechanics 12:00 Xiang Huang, Jack H. Lutz, and Andrei N. Migunov Algorithmic randomness in chemical reaction networks 12:30 Lunch 14:00 Pieter Collins (Invited Talk) Rigorous numerical computing with Ariadne 15:00 Florian Steinberg coqrep: A Coq library for representations 15:30 Coffee Break 16:00 Svetlana Selivanova and Victor Selivanov Bit complexity of computing solutions of boundary-value problems for some systems of PDEs with guaranteed precision 16:30 Ivan Koswara, Svetlana
    [Show full text]
  • Characterization Theorem for the Conditionally Computable Real Functions
    Logical Methods in Computer Science Vol. 13(3:3)2017, pp. 1–17 Submitted Mar. 14, 2016 www.lmcs-online.org Published Jul. 6, 2017 CHARACTERIZATION THEOREM FOR THE CONDITIONALLY COMPUTABLE REAL FUNCTIONS IVAN GEORGIEV Prof. D-r Asen Zlatarov University, bul. Prof. Yakimov 1, Burgas, Bulgaria e-mail address: [email protected] Abstract. The class of uniformly computable real functions with respect to a small subrecursive class of operators computes the elementary functions of calculus, restricted to compact subsets of their domains. The class of conditionally computable real functions with respect to the same class of operators is a proper extension of the class of uniformly computable real functions and it computes the elementary functions of calculus on their whole domains. The definition of both classes relies on certain transformations of infinitistic names of real numbers. In the present paper, the conditional computability of real functions is characterized in the spirit of Tent and Ziegler, avoiding the use of infinitistic names. Introduction This paper is in the field of computable analysis, where mathematical analysis meets classical computability theory. Some of the basic objects, which are studied in computable analysis are those real numbers and real functions, which can be computed using algorithms. Alan Turing gave in [12] the first definition for the notion of computable real number { this is a real number, whose decimal representation can be computed by a Turing machine. It is well-known that several other representations of real numbers lead to an equivalent notion, although the use of fast converging Cauchy sequences of rational numbers seems most natural when developing computable analysis.
    [Show full text]
  • Curriculum Vitae
    Roussanka Loukanova Curriculum Vitae Roussanka Loukanova July 18, 2021 Contents I CV R´esum´e3 1 Education and Degrees3 2 Academic Qualification4 3 Pedagogic Training4 4 Employment and Association4 4.1 Present...........................................4 4.2 Former Positions......................................4 4.3 Visiting Positions and Fellowships............................5 II Scientific Profile6 5 Expertise 6 6 Experience with Software Packages7 III Pedagogic Profile7 7 Experience in Teaching7 7.1 Courses Taught and Developed..............................8 8 Experience as a Supervisor9 8.1 Supervision of Bachelor and Master's Theses......................9 8.2 Supervision of Ph.D. Students...............................9 8.3 Participation in Evaluation Committees of M.Sc. and Ph.D. Theses.........9 9 Training in Teaching and Learning in Higher Education9 10 Some Pedagogical Work and Teaching Materials 10 IV Grants 10 V Scholarly Activities 13 1 / 27 Roussanka Loukanova 11 Scientific Organizations, Committees 13 11.1 Organization Committees................................. 13 11.2 Reviewing and Member of Program Committees.................... 15 11.2.1 Area Supervisory Committee........................... 15 11.2.2 Program Committees............................... 15 12 Other International Engagements 16 12.1 Tutorials........................................... 16 12.2 Some Conference and Seminar Participation, Talks, Presentations........... 16 VI Scientific Works 18 13 Work in Progress 18 14 List of Publications 19 14.1 Publications
    [Show full text]
  • Association for Symbolic Logic
    Association for Symbolic Logic Business Office: Box 742, Vassar College 124 Raymond Avenue, Poughkeepsie, New York 12604, USA Fax: 1-845-437-7830; email: [email protected] Web: http://www.aslonline.org ASL NEWSLETTER January 2014 • In Memoriam: Ivan Soskov. Ivan Soskov passed away suddenly and unexpectedly on May 5, 2013 in Sofia at the age of 58. He was a remarkable man, not only as a mathematician, but also as a person. His contributions to computability theory are deep and will continue to bear fruit long after his death, as will his contributions to the logic group in Bulgaria and to the computability theory community around the world. Soskov was born on September 23, 1954, in Stara Zagora in southern Bulgaria. When he was 13 he moved to Sofia to attend the National High School of Mathematics and Sciences, a school dedicated to offering an introduction to mathematics to the most talented students. He earned his undergraduate degree in mathematical logic from Sofia University in 1979. He was awarded his Ph.D. in 1983 from the same university, under the supervision of Dimiter Skordev, for his thesis entitled, Computability in partial algebraic systems. Starting in 1986, a series of international conferences organized by the Department of Mathematical Logic at Sofia University took place at which prominent scientists from around the world participated. It was at one of these conferences that Soskov met Yiannis Moschovakis, from UCLA. Moschovakis had invented the notions of Prime and Search Computability, which were at the heart of Soskov's Ph.D. dissertation, and guided his research later in life.
    [Show full text]
  • Table of Contents
    Table of Contents Preface : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : V S. Barry Cooper, Benedikt LÄowe, Leen Torenvliet Query learning of Horn formulas revisited : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 Jose L. Balc¶azar The internal logic of Bell's states : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 18 Giulia Battilotti, Paola Zizzi Logical Characterizations of PK and NPK over an Arbitrary Structure : 30 Olivier Bournez, Felipe Cucker, Paulin Jacob¶e de Naurois, Jean-Yves K Marion Fuzzy Interval-valued Processes Algebra : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 44 Yixiang Chen, Jie Zhou Computable Analysis in Systems and Control : : : : : : : : : : : : : : : : : : : : : : : : 58 Pieter Collins Polynomial complexity for analog computation : : : : : : : : : : : : : : : : : : : : : : : 59 Jose Felix Costa, Jerzy Mycka Constructive set theory with operations : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 60 Laura Crosilla, Andrea Cantini On Learning Conjunctions of Horn Clauses : : : : : : : : : : : : : : : : : : : : : : : : : 61 Joxe Gaintzarain, Montserrat Hermo, Marisa Navarro Defying Dimensions Modulo 6 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 71 Vince Grolmusz Solving SAT with membrane creation : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 82 Miguel Angel¶ Guti¶errez-Naranjo, Mario J. P¶erez-Jim¶enez, Francisco Jos¶e Romero-Campero Polynomial
    [Show full text]
  • Logical Approaches to Barriers in Computing and Complexity
    Arnold Beckmann Christine Gaßner Benedikt L¨owe (Eds.) Logical Approaches to Barriers in Computing and Complexity International Workshop, Greifswald, Germany, February 2010 Organized by the Alfried Krupp Wissenschaftskolleg Greifswald under the auspices of the Deutsche Vereinigung f¨urMathematische Logik und f¨ur Grundlagen der Exakten Wissenschaften (DVMLG), the Polskie Towarzystwo Logiki i Filozofii Nauki (PTLiFN), the Association for Computability in Europe (ACiE) and the European Association for Computer Science Logic (EACSL) Abstract Booklet Funded by the Alfried Krupp von Bohlen und Halbach-Stiftung, Essen and the Deutsche Forschungsgemeinschaft, Bonn Preface This booklet contains the extended abstracts of talks presented at the workshop on Logical Approaches to Barriers in Computing and Complexity, held on February 17{20, 2010, in Greifswald, Germany. The workshop was initiated by the Deutsche Vereinigung f¨urMathematische Logik und f¨urGrundlagen der Exakten Wissenschaften (DVMLG), the Polskie Towarzystwo Logiki i Filozofii Nauki (PTLiFN), the Association for Computability in Europe (ACiE) and the European Association for Computer Science Logic (EACSL) and organized under the auspices of these four learn`edsocieties. The workshop was funded by the Alfried Krupp von Bohlen und Halbach-Stiftung, Essen and the Deutsche Forschungsgemeinschaft, Bonn, and it was run by and held at the Alfried Krupp Wissenschaftskolleg in Greifswald, Germany. Scientific Scope. Computability theory and complexity theory have their origins in logic, with connec- tions to foundations of mathematics. The fundamental goal in these areas is to understand the limits of computability (that is analysing which problems can be solved on nowadays and future computers in principle) and effective computability (that is understanding the class of problems which can be solved quickly and with restricted resources.) Logic provides a multifarious toolbox of techniques to analyse questions like this, some of which promise to provide a deep insight in the structure of limit of compu- tation.
    [Show full text]