DOCSLIB.ORG

Algorithmic Complexity of Well-Quasi-Orders Sylvain Schmitz

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Algorithmic Complexity of Well-Quasi-Orders Sylvain Schmitz Algorithmic Complexity of Well-Quasi-Orders Sylvain Schmitz To cite this version: Sylvain Schmitz. Algorithmic Complexity of Well-Quasi-Orders. Logic in Computer Science [cs.LO]. École normale supérieure Paris-Saclay, 2017. tel-01663266 HAL Id: tel-01663266 https://tel.archives-ouvertes.fr/tel-01663266 Submitted on 13 Dec 2017 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Distributed under a Creative Commons Attribution - NoDerivatives| 4.0 International License Algorithmic Complexity of Well-Quasi-Orders Habilitation à diriger des recherches préparée à l’École Normale Supérieure Paris-Saclay au sein du Laboratoire Spécification & Vérification Présentée et soutenue à Cachan, le 27 novembre 2017, par Sylvain Schmitz Composition du jury : Mikołaj Bojańczyk Rapporteur Professeur, Universytet Warszawski Javier Esparza Rapporteur Professeur, Technische Universität München Alain Finkel Examinateur Professeur, École Normale Supérieure Paris-Saclay Géraud Sénizergues Rapporteur Professeur, Université de Bordeaux Andreas Weiermann Examinateur Professeur, Universiteit Gent James B. Worrell Examinateur Professeur, University of Oxford Habilitation à diriger des recherches Algorithmic Complexity of Well-Quasi-Orders Habilitation Thesis Sylvain Schmitz © Sylvain Schmitz licensed under Creative Commons License CC-BY-ND Acknowledgements * I am indebted to a very large number of people who supported me on insti- tutional, scientific, and personal levels while carrying this work. My first thanks go to all the people I have worked along with atthe Labora- toire Spécification et Vérification in Cachan over the nine years I have spent there since 2008: to the administrative and technical staff for their kindness and avail- ability, to my current students Simon Halfon and Anthony Lick and my former intern and visiting students for thought-provoking discussions, and to all my col- leagues for creating such a supportive and stimulating environment—it has been an incredibly formative experience, I have learned so much from all of you. Spe- cial thanks go to Alain Finkel, Jean Goubault-Larrecq, and Philippe Schnoebelen, who introduced me to the theory of well-quasi-orders when I arrived in Cachan. Let me thank more generally all my co-authors over the years: it has been a privilege to work by your side. My lasting collaborations with Ranko Lazić and Philippe Schnoebelen have been especially influential: little of the work described in this habilitation would have existed without you. I also thank the members of the jury for their excellent comments and cor- rections on the manuscript, and for their patience and goodwill during the entire process. I have also benefited from the fantastic opportunity to teach at École Normale Supérieure Paris-Saclay all over these nine years; the demands of tutoring and lecturing to such an exacting audience have had a deep influence. I thank my students and everyone I shared a course with, and in particular Paul Gastin for his guidance as head of the computer science department when I started on the job, at what was then called ENS Cachan. To end on a personal note, I give my heartful thanks to Marie Antczak, Claire David, Laure Daviaud, Mahsa Shirmohammadi, and everyone else who joined in the nudging and encouraged me to complete this habilitation thesis. Thank you! *I acknowledge the institutional and financial support of ENS Paris-Saclay, CNRS, Inria, ANR, the Leverhulme Trust, the University of Warwick, and the University of Warsaw. i Contents Chapter 1. Introduction 1 1.1. General Context 1 1.1.1. Verification of Infinite-state Systems 1 1.1.2. A Game Changer: Well-Structured Systems 1 1.1.3. Tools and Practical Applications 2 1.1.4. The Complexity Question 2 1.2. Contributions 3 1.2.1. Techniques for Upper Bounds 3 1.2.2. Techniques for Lower Bounds 4 1.2.3. Complexity Classes 5 1.2.4. A Challenge: the Complexity of VASS Reachability 5 1.2.5. Other Contributions 7 Chapter 2. Well-Quasi-Orders & Applications 9 2.1. Basic Definitions 10 2.1.1. Well-Quasi-Orders 10 2.1.2. Examples 11 2.2. Application: Program Termination 11 2.2.1. Ranking Functions 12 2.2.2. Quasi-Ranking Functions 13 2.3. Application: Well-Structured Transition Systems 14 2.3.1. Formal Definition 15 2.3.2. Example: Lossy Counter Machines 15 2.3.3. Verifying WSTS 16 Chapter 3. Length Function Theorems 19 3.1. Controlling Bad Sequences 20 3.1.1. Normed wqos 21 3.1.2. Controlled Sequences 21 3.1.3. Length Functions 22 3.2. Subrecursive Hierarchies 23 3.2.1. Fundamental Sequences and Predecessors 23 3.2.2. Hardy and Cichoń Hierarchies 23 3.3. Length Functions for Ordinals Below "0 24 3.3.1. Residuals and a Descent Equation 25 3.3.2. Upper Bounds 25 3.4. Length Functions for Dickson’s Lemma 26 3.4.1. Polynomial Normed wqos 27 3.4.2. Reflecting Normed wqos 27 3.4.3. Maximal Order Types 29 iii iv CONTENTS 3.4.4. Upper Bounds 30 3.5. Related Work & Perspectives 31 3.5.1. Length Functions for Ordinals 31 3.5.2. Length Functions for Well-Quasi-Orders 32 3.5.3. Further Applications 32 3.5.4. Perspectives 33 Chapter 4. Fast-Growing Complexity 35 4.1. Complexity Classes Beyond ELEMENTARY 36 4.1.1. The Extended Grzegorczyk Hierarchy 36 4.1.2. The Fast-Growing Complexity Hierarchy 38 4.1.3. Example: LCM Coverability is in ACKERMANN 42 4.2. Lower Bounds Through Hardy Computations 43 4.2.1. Hardy-like Computations 44 4.2.2. Weak Computation in Lossy Counter Machines 45 4.2.3. Lower Bound 47 4.3. Related Work & Perspectives 49 4.3.1. Lower Bounds Through Counter Objects 49 4.3.2. Provability in Theories of Arithmetic 50 Chapter 5. Reachability in Vector Addition Systems 53 5.1. Basic Definitions 54 5.1.1. Vector Addition Systems with States 54 5.1.2. Closely Related Models 56 5.2. The Decomposition Algorithm 56 5.2.1. Marked Witness Graph Sequences 57 5.2.2. An Example of a KLMST Decomposition 58 5.2.3. Termination 60 5.3. Complexity Upper Bound 61 5.3.1. An Ordinal Ranking Function 61 5.3.2. Applying the Length Function Theorems 61 5.4. Related Work & Perspectives 63 5.4.1. Tightness 63 5.4.2. Restrictions 64 5.4.3. Extensions 67 Chapter 6. Perspectives 69 6.1. Complexity of VASS Reachability 69 6.2. Parameterised Bounds 69 6.3. Algorithmic Applications of Ideals 70 6.3.1. Ideals 70 6.3.2. A Dual Backward Coverability Algorithm 71 6.3.3. Beyond Well-Quasi-Orders 72 6.4. Reachability in VASS Extensions 72 6.4.1. Branching VASS Reachability 73 6.4.2. Ideal Decomposition of the Set of Executions 73 Appendix A. Technical Appendix 75 A.1. Ordinals 75 A.1.1. Ordinals Terms 75 CONTENTS v A.1.2. Maximal Order Types 76 A.2. Subrecursive Functions 76 A.2.1. Monotonicity Properties 76 References 79 List of Publications 93 CHAPTER 1 Introduction 1.1. General Context The main motivations for this thesis are rooted in formal verification, and in particular in model-checking techniques. This might come as a surprise, be- cause the title seems centred on well-quasi-orders, which are a rather abstract concept, whose invention can be tracked back to the early 1910s and whose theory was developed by mathematicians like Higman [1952], Kruskal [1972], de Jongh and Parikh [1977], and many others. Model-checking on the other hand, while certainly grounded on sound mathematical concepts [e.g. Vardi, 2009], is an emi- nently practical field of computer science with a widespread adoption in thehard- ware industry. At its core, it consists of a fully automated, algorithmic check that a model of a system—like a concrete sequential circuit—satisfies its specification— like a safety check that no bad configuration can ever be reached in the model. 1.1.1. Verification of Infinite-state Systems. Once the general underpin- nings of model-checking for finite-state systems were well-understood, the focus of the formal verification community turned in the 1990s to infinite-state systems. Indeed, many critical systems worth the time and effort required by formal ver- ification are infinite, due to unbounded variables: integer counters, numberof active threads in concurrent settings, real-time clocks, stacks, nonces, communi- cation channels, etc. In some specific instances, these infinite-state systems are ‘essentially finite-state’ and can be faithfully abstracted into finite onesby finite partitioning, i.e. by quotienting them using a bisimulation equivalence of finite index—this method was notably behind the success of timed automata [Alur and Dill, 1994]. But at that time this research area was lacking common methods and general principles to cope with cases where finite partitioning failed. 1.1.2. A Game Changer: Well-Structured Systems. This situation was remedied by Abdulla, Čerāns, Jonsson, and Tsay [2000] and Finkel and Schnoebe- len [2001], who popularised the notion of well-structured systems. Their approach can be understood as a generalisation of the finite partitioning method, using instead simulation quasi-orders. The finiteness condition on the equivalence’s in- dex was accordingly replaced by a much more flexible condition: this quasi-order should be a well-quasi-order (a wqo).
Load more

Recommended publications
  • Hyperoperations and Nopt Structures
    Hyperoperations and Nopt Structures Alister Wilson Abstract (Beta version) The concept of formal power towers by analogy to formal power series is introduced. Bracketing patterns for combining hyperoperations are pictured. Nopt structures are introduced by reference to Nept structures. Briefly speaking, Nept structures are a notation that help picturing the seed(m)-Ackermann number sequence by reference to exponential function and multitudinous nestings thereof. A systematic structure is observed and described. Keywords: Large numbers, formal power towers, Nopt structures. 1 Contents i Acknowledgements 3 ii List of Figures and Tables 3 I Introduction 4 II Philosophical Considerations 5 III Bracketing patterns and hyperoperations 8 3.1 Some Examples 8 3.2 Top-down versus bottom-up 9 3.3 Bracketing patterns and binary operations 10 3.4 Bracketing patterns with exponentiation and tetration 12 3.5 Bracketing and 4 consecutive hyperoperations 15 3.6 A quick look at the start of the Grzegorczyk hierarchy 17 3.7 Reconsidering top-down and bottom-up 18 IV Nopt Structures 20 4.1 Introduction to Nept and Nopt structures 20 4.2 Defining Nopts from Nepts 21 4.3 Seed Values: “n” and “theta ) n” 24 4.4 A method for generating Nopt structures 25 4.5 Magnitude inequalities inside Nopt structures 32 V Applying Nopt Structures 33 5.1 The gi-sequence and g-subscript towers 33 5.2 Nopt structures and Conway chained arrows 35 VI Glossary 39 VII Further Reading and Weblinks 42 2 i Acknowledgements I’d like to express my gratitude to Wikipedia for supplying an enormous range of high quality mathematics articles.
    [Show full text]
  • An Introduction to Ramsey Theory Fast Functions, Infinity, and Metamathematics
    STUDENT MATHEMATICAL LIBRARY Volume 87 An Introduction to Ramsey Theory Fast Functions, Infinity, and Metamathematics Matthew Katz Jan Reimann Mathematics Advanced Study Semesters 10.1090/stml/087 An Introduction to Ramsey Theory STUDENT MATHEMATICAL LIBRARY Volume 87 An Introduction to Ramsey Theory Fast Functions, Infinity, and Metamathematics Matthew Katz Jan Reimann Mathematics Advanced Study Semesters Editorial Board Satyan L. Devadoss John Stillwell (Chair) Rosa Orellana Serge Tabachnikov 2010 Mathematics Subject Classification. Primary 05D10, 03-01, 03E10, 03B10, 03B25, 03D20, 03H15. Jan Reimann was partially supported by NSF Grant DMS-1201263. For additional information and updates on this book, visit www.ams.org/bookpages/stml-87 Library of Congress Cataloging-in-Publication Data Names: Katz, Matthew, 1986– author. | Reimann, Jan, 1971– author. | Pennsylvania State University. Mathematics Advanced Study Semesters. Title: An introduction to Ramsey theory: Fast functions, infinity, and metamathemat- ics / Matthew Katz, Jan Reimann. Description: Providence, Rhode Island: American Mathematical Society, [2018] | Series: Student mathematical library; 87 | “Mathematics Advanced Study Semesters.” | Includes bibliographical references and index. Identifiers: LCCN 2018024651 | ISBN 9781470442903 (alk. paper) Subjects: LCSH: Ramsey theory. | Combinatorial analysis. | AMS: Combinatorics – Extremal combinatorics – Ramsey theory. msc | Mathematical logic and foundations – Instructional exposition (textbooks, tutorial papers, etc.). msc | Mathematical
    [Show full text]
  • A Survey of Recursive Analysis and Moore's Notion of Real Computation
    A Survey of Recursive Analysis and Moore’s Notion of Real Computation Walid Gomaa INRIA Nancy Grand-Est Research Centre, France, Faculty of Engineering, Alexandria University, Egypt [email protected] Abstract The theory of analog computation aims at modeling computational systems that evolve in a continuous manner. Unlike the situation with the discrete setting there is no unified theory of analog computation. There are several proposed theories, some of them seem quite orthogonal. Some theories can be considered as generalizations of the Turing machine theory and classical recursion theory. Among such are recursive analysis and Moore’s class of recursive real functions. Recursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], and D. Lacombe [1955]. Real computation in this context is viewed as effective (in the sense of Turing machine theory) convergence of sequences of rational numbers. In 1996 Moore introduced a function algebra that captures his notion of real computation; it consists of some basic functions and their closure under composition, integration and zero- finding. Though this class is inherently unphysical, much work have been directed at stratifying, restricting, and comparing it with other theories of real computation such as recursive analysis and the GPAC. In this article we give a detailed exposition of recursive analysis and Moore’s class and the relationships between them. 1 Introduction Analog computation is a computational paradigm that attempts to model systems whose internal states are continuous rather than discrete. Unlike the case of discrete computation, which has enjoyed a kind of uniformity and conceptual universality, there have been several approaches to analog computations some of which are not even comparable.
    [Show full text]
  • 0.1 Axt, Loop Program, and Grzegorczyk Hier- Archies
    1 0.1 Axt, Loop Program, and Grzegorczyk Hier- archies Computable functions can have some quite complex definitions. For example, a loop programmable function might be given via a loop program that has depth of nesting of the loop-end pair, say, equal to 200. Now this is complex! Or a function might be given via an arbitrarily complex sequence of primitive recursions, with the restriction that the computed function is majorized by some known function, for all values of the input (for the concept of majorization see Subsection on the Ackermann function.). But does such definitional|and therefore, \static"|complexity have any bearing on the computational|dynamic|complexity of the function? We will see that it does, and we will connect definitional and computational complexities quantitatively. Our study will be restricted to the class PR that we will subdivide into an infinite sequence of increasingly more inclusive subclasses, Si. A so-called hierarchy of classes of functions. 0.1.0.1 Definition. A sequence (Si)i≥0 of subsets of PR is a primitive recur- sive hierarchy provided all of the following hold: (1) Si ⊆ Si+1, for all i ≥ 0 S (2) PR = i≥0 Si. The hierarchy is proper or nontrivial iff Si 6= Si+1, for all but finitely many i. If f 2 Si then we say that its level in the hierarchy is ≤ i. If f 2 Si+1 − Si, then its level is equal to i + 1. The first hierarchy that we will define is due to Axt and Heinermann [[5] and [1]].
    [Show full text]
  • Hierarchies of Recursive Functions
    Leibniz Universitat¨ Hannover Institut f¨urtheoretische Informatik Bachelor Thesis Hierarchies of recursive functions Maurice Chandoo February 21, 2013 Erkl¨arung Hiermit versichere ich, dass ich diese Arbeit selbst¨andigverfasst habe und keine anderen als die angegebenen Quellen und Hilfsmittel verwendet habe. i Dedicated to my dear grandmother Anna-Maria Kniejska ii Contents 1 Preface 1 2 Class of primitve recursive functions PR 2 2.1 Primitive Recursion class PR ..................2 2.2 Course-of-value Recursion class PRcov .............4 2.3 Nested Recursion class PRnes ..................5 2.4 Recursive Depth . .6 2.5 Recursive Relations . .6 2.6 Equivalence of PR and PRcov .................. 10 2.7 Equivalence of PR and PRnes .................. 12 2.8 Loop programs . 14 2.9 Grzegorczyk Hierarchy . 19 2.10 Recursive depth Hierarchy . 22 2.11 Turing Machine Simulation . 24 3 Multiple and µ-recursion 27 3.1 Multiple Recursion class MR .................. 27 3.2 µ-Recursion class µR ....................... 32 3.3 Synopsis . 34 List of literature 35 iii 1 Preface I would like to give a more or less exhaustive overview on different kinds of recursive functions and hierarchies which characterize these functions by their computational power. For instance, it will become apparent that primitve recursion is more than sufficiently powerful for expressing algorithms for the majority of known decidable ”real world” problems. This comes along with the hunch that it is quite difficult to come up with a suitable problem of which the characteristic function is not primitive recursive therefore being a possible candidate for exploiting the more powerful multiple recursion. At the end the Turing complete µ-recursion is introduced.
    [Show full text]
  • Fractional Mathematical Operators and Their Computational Approximation
    Hindawi Publishing Corporation Mathematical Problems in Engineering Volume 2016, Article ID 4356371, 11 pages http://dx.doi.org/10.1155/2016/4356371 Research Article Fractional Mathematical Operators and Their Computational Approximation José Crespo and Francisco Javier Montáns Escuela Tecnica´ Superior de Ingenier´ıa Aeronautica´ y del Espacio, Universidad Politecnica´ de Madrid, Plaza Cardenal Cisneros 3, 28040 Madrid, Spain Correspondence should be addressed to Francisco Javier Montans;´ [email protected] Received 27 January 2016; Revised 30 July 2016; Accepted 9 August 2016 Academic Editor: Manuel Doblare´ Copyright © 2016 J. Crespo and F. J. Montans.´ This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Usual applied mathematics employs three fundamental arithmetical operators: addition, multiplication, and exponentiation. However, for example, transcendental numbers are said not to be attainable via algebraic combination with these fundamental operators. At the same time, simulation and modelling frequently have to rely on expensive numerical approximations of the exact solution. The main purpose of this article is to analyze new fractional arithmetical operators, explore some of their properties, and devise ways of computing them. These new operators may bring new possibilities, for example, in approximation theory and in obtaining closed forms of those approximations and solutions. We show some simple demonstrative examples. 1. Introduction parameters [2, 3] rendering linear equations. We will also see possible applications of the presented operators in constitu- Science mostly hinges on mathematics which has been built tive modelling. on three fundamental operations: the addition, the multipli- Consider the classification described in Table 1.
    [Show full text]
  • The Grzegorczyk Hierarchy
    Chapter 4 The Grzegorczyk Hierarchy 4.1 Reprise The primitive recursive functions are defined as the closure of R and C over a basic stock of functions. Both the logician’s diagonal argument and the double- recursion diagonal arguments involve functions that can “simulate” n nested primitive recursions when given an argument n. Intuitively, the situation is that each primitive recursive function is allowed only finitely many nested primitive recursions, so functions that require arbitrarily many (without bound) are not primitive recursive. This situation calls out for greater attention to which functions can be de- fined with a given, fixed number of primitive recursion operations. In other words, it makes sense to look at the hierarchy of increasing classes En defined in terms of increasing numbers of primitive recursions, where each class is closed under composition. Every primitive recursive function will be at some finite level of the hierarchy: [ P rim = Ex x A natural idea would be to start with the basic functions closed under com- position and then to add in successively more complex functions like addition, multiplication, exponentiation, etc., closing under composition each time. But composition is a little weak. Recall that some slow-growing functions like cutoff subtraction required the R schema for their definitions even though they don’t really use it to generate faster growth. We would like to distinguish growth- generating applications of R from applications that don’t generate growth. We can get around the difficulty by closing each class under bounded re- cursion as well as composition. An application of R is bounded in a class of functions if the function resulting from the application is bounded everywhere by some other function already established to be in the class.
    [Show full text]
  • Solving for the Analytic Piecewise Extension of Tetration and the Super-Logarithm
    Solving for the Analytic Piecewise Extension of Tetration and the Super-logarithm by Andrew Robbins Abstract An overview of previous extensions of tetration is presented. Specific conditions for differentiability and piecewise continuity are shown. This leads to a way of generating approximations of the super-logarithm. These approximations are shown to converge to a function that satisfies two basic properties of extensions of tetration. Table of Contents Introduction 2 Background 4 Extensions 6 Results 10 Generalization 20 Conclusion 21 Appendices 22 Copyright 2005 Andrew Robbins 1 Introduction Of the operators in the sequence: addition, multiplication, exponentiation, and tetration, only the first three are well-defined analytic operations. Tetration, also known as the hyper4 operator, power towers, and iterated exponentiation, has only been “nicely” defined for integer y in y x . Although extensions of tetration to real y have been made, those extensions have not followed simply from the properties of hyper-operations. The particular form of this property as it pertains to tetration is: Property 1. Iterated exponential property y−1 y x = x( x ) for all real y. Tetration has two inverses, the super-root, and the super-logarithm: = y = = z x tet x ( y ) twr y ( x ) = = −1 x srt y ( z ) twr y ( z ) = = −1 y slogx ( z ) tet x ( z ) When y is fixed, the function twr y ( x ) is called an order y power tower of x [14]. When x is fixed, the function tet x ( y ) is called a base x tetrational function of y. In general, it is pronounced: x tetra y. Inverting a power tower gives the super-root, and inverting a tetrational function gives the super-logarithm, More detail about these inverses can be found in [12], [14] and [15].
    [Show full text]
  • Lecture 15 CS 6110 Spring 2015 Wed
    Advanced Progamming Languages Lecture 15 CS 6110 Spring 2015 Wed. Feb. 25, 2015 Lecture 15 Midterm reminder - Friday, March 6 Topics 1. Comments on Abstract State Machine in Dr. Rahli's lectures { The heart of Theory B { with a Theory A analogue 2. Partial recursive numerical functions (Kleene 1936, Turing 1937) and General recursive functions, Herbrand-G¨odel1932 3. Kleene Normal Form theorem (Kleene T-predicate) using primitve recursion, only the elementary subset. Related to acceptable indexing, Rogers 1967 4. Textbook material Church-Rosser Theorem p.163 Typed λ-calculus, section 2.6 p.42 Strong normalization theorem p.45 5. Deep problems remain lurking here on the Theory B side in G¨odelnumbering versus meta language insights. Need to ask the right question. 1. Abstract State Machines for the λ-calculus These machines are not only conceptually interesting, they are practical and provide the basis for functional language compilers and bootstrapping. This is Theory B semantics in practice. You can study the Krevine and Landin machines in detail in the BRICS 2003 article along with other state machines. 2. Partial recursive functions and General recursive functions Please read the Kleene material included with the lecture. He describes G¨odel'sinsight to simplify Herbrand's idea, which is this (p.274 Kleene): (i) Write down any mutually recursive equations that define a total function ' re- cursively (ii) Show that they define the intended function ' by finitary means, say intuitionistic methods. 1 G¨odel's\bold generalization" - only require (i), since showing they define a function will likely require a proof by induction, but any fintary proof will suffice.
    [Show full text]
  • Fifty Years of the Spectrum Problem: Survey and New Results
    FIFTY YEARS OF THE SPECTRUM PROBLEM: SURVEY AND NEW RESULTS A. DURAND, N. D. JONES, J. A. MAKOWSKY, AND M. MORE Abstract. In 1952, Heinrich Scholz published a question in the Journal of Sym- bolic Logic asking for a characterization of spectra, i.e., sets of natural numbers that are the cardinalities of finite models of first order sentences. G¨unter Asser asked whether the complement of a spectrum is always a spectrum. These innocent questions turned out to be seminal for the development of finite model theory and descriptive complexity. In this paper we survey developments over the last 50-odd years pertaining to the spectrum problem. Our presentation follows conceptual devel- opments rather than the chronological order. Originally a number theoretic problem, it has been approached in terms of recursion theory, resource bounded complexity theory, classification by complexity of the defining sentences, and finally in terms of structural graph theory. Although Scholz’ question was answered in various ways, Asser’s question remains open. One appendix paraphrases the contents of several early and not easily accesible papers by G. Asser, A. Mostowski, J. Bennett and S. Mo. Another appendix contains a compendium of questions and conjectures which remain open. To be submitted to the Bulletin of Symbolic Logic. January 23, 2018 (version 13.2) Contents 1. Introduction 3 2. The Emergence of the Spectrum Problem 4 2.1. Scholz’s problem 4 2.2. Basic facts and questions 5 arXiv:0907.5495v1 [math.LO] 31 Jul 2009 2.3. Immediate responses to H. Scholz’s problem 6 2.4.
    [Show full text]
  • Non Primitive Recursive Complexity Classes
    Non Primitive Recursive Complexity Classes Simon Halfon, ENS Cachan August 22, 2014 supervised by Philippe Schnoebelen and Sylvain Schmitz Team INFINI, LSV, ENS Cachan 1 Introduction / Summary File The general context The introduction of Well Structured Transition Systems (WSTS) in 1987 [8], i.e. transition systems that satisfies a monotony property with respect to some well-quasi-ordering (wqo), has led to an important number of decidability results of verification problems for several natural models: Petri Nets and VASS and a large number of their extensions, lossy channel systems, string rewrite systems, process algebra, communicating automaton, and so on. Surveys of results and applications obtained with this theory can be found in [9, 3, 1, 2]. The main idea behind these decidability results is a generic algorithm that explores a tree that must be finite by the wqo property: every infinite sequence of configurations of the system (xi)i2N has an increasing pair, that is a pair i < j such that xi ≤ xj. Moreover, wqo theory has provided upper bound to these algorithms by bounding the length of so called bad sequences, (finite) sequences that do not have an increasing pair. The bounds obtained are non-primitive-recursive, which is unusual in verification. In addition, matching lower bounds has been proved for several models [19, 6]. The research problem Considering the growing number of new problems with a non-primitive-recursive complexity, it is natural to ask for a finer classification, and therefore the formalization of non-elementary complexity classes. This has been achieved by the introduction of a hierarchy of ordinal-indexed fast-growing complexity classes (Fα)α [18].
    [Show full text]
  • Classes of Sub-Recursive Function Selected Bibliography
    Classes of sub-recursive function Selected bibliography Armando B. Matos1 November 7, 2012 1Email: [email protected] This is a personal bibliography on classes of sub-recursive functions. The references in the abstracts have been omitted. 1 Bibliography [AAV10] Philippe Andary, Bruno Patrou Andary, and Pierre Valarcher. A rep- resentation theorem for primitive recursive algorithms. Fundamenta Informaticae, XX:1{18, 2010. Abstract. We formalize the algorithms computing primitive recursive (PR) functions as the abstract state machines (ASMs) whose running length is computable by a PR function. Then we show that there exists a programming language (implementing only PR functions) by which it is possible to implement any one of the previously defined algorithms for the PR functions in such a way that their complexity is preserved. [Axt59] Paul Axt. On a subrecursive hierarchy and primitive recursive degrees. Transactions of the American Mathematical Society, 92:85{105, 1959. (From the Introduction) We shall investigate some problems connected with these classifications [of general and primitive recursive degrees]. First a uniqueness property of classes Cy associated with notations for the same ordinal is described and shown to hold at ordinals less than !2 and to fail at !2. The k-recursive functions of Peter are located in the hierarchy below the !! level. Although it is not yet settled whether all recursive functions are obtained, it is clear that [y2OCy is a large and interesting class. Finally primitive recursive degrees are studied, and certain similarities to and differences from the theory of general recursive degrees of [Kleene and Post reference] are obtained. [Axt63] Paul Axt.
    [Show full text]