Topics in the Theory of Computation ( Volume 24 )

Publication series ：Volume 24

Author： Karpinski M.;Leeuwen J. van

Publisher： Elsevier Science‎

Publication year： 1985

E-ISBN: 9780080872131

P-ISBN(Paperback): 9780444876478

P-ISBN(Hardback): 9780444876478

Subject： O158 Discrete Mathematics;TP3 Computers

Language： ENG

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Description

This volume contains nine selected papers presented at the Borgholm conference. They were chosen on the basis of their immediate relevance to the most fundamental aspects of the theory of computation and the newest developments in this area.

These papers, which have been extended and refereed, fall into eight categories: 1. Constructive Mathematics in Models of Computation and Programming; 2. Abstract Calculi and Denotational Semantics; 3. Theory of Machines, Computations and Languages; 4. Nondeterminism, Concurrency and Distributed Computing; 5. Abstract Algebras, Logics and Combinatorics in Computation Theory; 6. General Computability and Decidability; 7. Computational and Arithmetic Complexity; 8. Analysis of Algorithms and Feasible Computing.

Chapter

Front Cover

pp.： 1 – 4

Topics in the Theory of Computation

pp.： 4 – 5

pp.： 5 – 10

Preface

pp.： 6 – 12

Table of Contents

pp.： 10 – 6

Chapter 1. Input-driven Languages are recognized in log n space

pp.： 12 – 32

Chapter 2. Constructive mathematics as a programming logic I: Some principles of theory

pp.： 32 – 50

Chapter 3. Space and reversal complexity of probabilistic one-way Turing machines

pp.： 50 – 62

Chapter 4. Recurring dominoes: Making the highly undecidable highly understandable

pp.： 62 – 84

Chapter 5. A new transformational approach to partial correctness proof calculi for algol 68-like programs with finite modes and simple sideeffects

pp.： 84 – 114

Chapter 6. Effective determination of the zeros of p-ADIC exponential functions

pp.： 114 – 122

Chapter 7. The logic of games and its applications

pp.： 122 – 152

Chapter 8. A fast parallel construction of disjoint paths in networks

pp.： 152 – 166

Chapter 9. Descriptional complexity for classes of Ianov-schemes

pp.： 166 – 198

Author Index

pp.： 198 – 200

Annals of Discrete Mathematics

pp.： 200 – 204

The users who browse this book also browse