Fundamentals of Computation Theory

The language for the formulation of the interesting statements is, of course, most important. We use first order predicate logic. Our main achievement in this paper is an axiom system which we believe to be more powerful than any other natural general purpose discovery axiom system. We prove soundness of this axiom system in this paper. Additionally we prove that if we remove some of the requirements used in our axiom system, the system becomes not sound. We characterize the complexity of the quantifier prefix which guaranties provability of a true formula via our system. We prove also that if a true formula contains only monadic predicates, our axiom system is capable to prove this formula in the considered model.

[1]  Jacques Sakarovitch.  Easy Multiplications. I. The Realm of Kleene's Theorem , 1987, Inf. Comput..

[2]  Claude E. Shannon,et al.  A Universal Turing Machine with Two Internal States , 1956 .

[3]  Philip S. Yu,et al.  Scheduling parallel tasks to minimize average response time , 1994, SODA '94.

[4]  Martin Skutella,et al.  Convex Quadratic Programming Relaxations for Network Scheduling Problems , 1999, ESA.

[5]  Gerhard J. Woeginger,et al.  A PTAS for minimizing the weighted sum of job completion times on parallel machines , 1999, STOC '99.

[6]  Werner Kuich,et al.  An Algebraic Characterization of Some Principal Regulated Rational Cones , 1982, J. Comput. Syst. Sci..

[7]  Manfred Kudlek,et al.  A Universal Turing Machine with 3 States and 9 Symbols , 2001, Developments in Language Theory.

[8]  Edward Ochmanski,et al.  Regular behaviour of concurrent systems , 1985, Bull. EATCS.

[9]  R. J. Nelson,et al.  Introduction to Automata , 1968 .

[10]  Werner Kuich,et al.  On Certain Closure Operators Defined by Families of Semiring Morphisms , 1999 .

[11]  Marvin Minsky,et al.  Size and structure of universal Turing machines using Tag systems , 1962 .

[12]  Martin Skutella,et al.  Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria , 1997, ESA.

[13]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[14]  Gerhard J. Woeginger,et al.  Polynomial time approximation algorithms for machine scheduling: ten open problems , 1999 .

[15]  Najiba Sbihi,et al.  Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile , 1980, Discret. Math..

[16]  Martin Skutella,et al.  Semidefinite relaxations for parallel machine scheduling , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[17]  David B. Shmoys,et al.  Using Linear Programming in the Design and Analysis of Approximation Algorithms: Two Illustrative Problems , 1998, APPROX.

[18]  Werner Kuich,et al.  Matrix Systems and Principal Cones of Algebraic Power Series , 1996, Theoretical Computer Science.

[19]  Martin W. P. Savelsbergh,et al.  An experimental study of LP-based approximation algorithms for scheduling problems , 1998, SODA '98.

[20]  Gerhard J. Woeginger,et al.  When does a dynamic programming formulation guarantee the existence of an FPTAS? , 1999, SODA '99.

[21]  Igor E. Zverovich.  Extension of Hereditary Classes with Substitutions , 2003, Discret. Appl. Math..

[22]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[23]  Stephan Olariu,et al.  On the Closure of Triangle-Free Graphs Under Substitution , 1990, Inf. Process. Lett..

[24]  S. Poljak.  A note on stable sets and colorings of graphs , 1974 .

[25]  Martin Skutella,et al.  Random-Based Scheduling: New Approximations and LP Lower Bounds , 1997, RANDOM.

[26]  Arto Salomaa,et al.  Semirings, Automata, Languages , 1985, EATCS Monographs on Theoretical Computer Science.

[27]  Sheila A. Greibach,et al.  An Infinite Hierarchy of Context-Free Languages , 1967, JACM.

[28]  Raphael M. Robinson,et al.  MINSKY'S SMALL UNIVERSAL TURING MACHINE , 1991 .

[29]  Werner Kuich,et al.  Semirings and Formal Power Series: Their Relevance to Formal Languages and Automata , 1997, Handbook of Formal Languages.

[30]  Yurii Rogozhin,et al.  Small Universal Turing Machines , 1996, Theor. Comput. Sci..

[31]  F. Radermacher,et al.  Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization , 1984 .

[32]  Jacques Sakarovitch,et al.  Easy Multiplications II. Extensions of Rational Semigroups , 1990, Inf. Comput..

[33]  Frank Plumpton Ramsey,et al.  On a Problem of Formal Logic , 1930 .

[34]  Emil L. Post.  Formal Reductions of the General Combinatorial Decision Problem , 1943 .

[35]  Eric Torng,et al.  Lower bounds for SRPT-subsequence algorithms for nonpreemptive scheduling , 1999, SODA '99.

[36]  Shuji Tsukiyama,et al.  A New Algorithm for Generating All the Maximal Independent Sets , 1977, SIAM J. Comput..

[37]  Marcel Paul Schützenberger,et al.  On the Definition of a Family of Automata , 1961, Inf. Control..

[38]  Seymour Ginsburg,et al.  Algebraic and Automata Theoretic Properties of Formal Languages , 1975 .

[39]  Mark S. Squillante,et al.  Optimal scheduling of multiclass parallel machines , 1999, SODA '99.

[40]  M. Yannakakis.  The Complexity of the Partial Order Dimension Problem , 1982 .