+612 9045 4394
Computation Theory and Logic : Lecture Notes in Computer Science - E. Borger

Computation Theory and Logic

Lecture Notes in Computer Science

By: E. Borger (Editor)

Paperback Published: 29th July 1987
ISBN: 9783540181705
Number Of Pages: 442

Share This Book:


or 4 easy payments of $39.60 with Learn more
Ships in 5 to 9 business days

This volume contains 37 invited research papers collected in memory of Dieter Roedding, who is known for his work on the classification of recursive functions, on reduction classes, on the spectrum problem and on the complexity of cardinality quantifiers in predicate logic and in arithmetical hierarchy. He was one of the first to pursue the interaction of logic and computer science. The volume reflects the wide spectrum of Dieter Roedding's scientific interests.

Contents: Minimal Pairs for Polynomial Time Reducibilities.- Primitve Recursive Word-Functions of One Variable.- Existential Fixed-Point Logic.- Unsolvable Decision Problems for Prolog Programs.- You have not Understood a Sentence, unless You Can Prove it.- On the Minimality of K, F, and D or: Why Löten is Non-Trival.- A 5-Color Extension-Theorem.- Closure Relations, Buchberger's Algorithm, and Polynomials in Infinitely Many Variables.- The Benefit of Microworlds in Learning Computer Programming.- Skolem Normal Forms Concerning the Least Fixpoint.- Spectral Representation of Recursively Enumerable and Coenumerable Predicates.- Aggregating Inductive Expertise on Partial Recursive Functions.- Domino Threads and Complexity.- Modelling of Cooperative Processes.- A Setting for Generalized Computability.- First-order Spectra with One Variable.- On the Early History of Register Machines.- Randomness, Provability, and the Separation of Monte Carlo Time and Space.- Representation Independent Query and Update Operations on Propositional Definite Horn Formulas.- Direct Construction of Mutually Orthogonal Latin Squares.- Negative Results about the Length Problem.- Some Results on the Complexity of Powers.- The Turing Complexity of AF C*-Algebras with Lattice-ordered Ko.- Remarks on SASL and the Verification of Functional Programming Languages.- Numerical Stability of Simple Geometric Algorithms in the Plane.- Communication with Concurrent Systems via I/O-Procedures.- A Class of exp-time Machines which can be Simulated by Polytape Machines.- alpha-beta-gamma-Automata Realizing Preferences.- Ein einfaches Verfahren zur Normalisierung unendlicher Herleitungen.- Grammars for Terms and Automata. On a Book by the late J. Richard Büchi.- Relative Konsistenz.- Segment Translation Systems.- First Steps towards a Theory of Complexity over more General Data Structures.- On the Power of Single-Valued Nondeterministic Polynomial Time Computations.- A Concatenation Game and the Dot-Depth Hierarchy.- Do there Exist Languages With an Arbitrarily Small Amount of Context-Sensitivity.- The Complexity of Symmetric Boolean Functions.

ISBN: 9783540181705
ISBN-10: 3540181709
Series: Lecture Notes in Computer Science
Audience: General
Format: Paperback
Language: English
Number Of Pages: 442
Published: 29th July 1987
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 2.36
Weight (kg): 0.64