Topics in the theory of computation : selected papers of the International Conference on "Foundations of Computation Theory", FCT '83, Borgholm, Sweden, August 21-27, 1983 /
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...
Saved in:
Corporate Authors: | ; |
---|---|
Group Author: | ; |
Published: |
North-Holland ; Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co.,
|
Publisher Address: | Amsterdam ; New York : New York, N.Y. : |
Publication Dates: | 1985. |
Literature type: | eBook |
Language: | English |
Series: |
Annals of discrete mathematics ;
24 North-Holland mathematics studies ; 102 |
Subjects: | |
Online Access: |
http://www.sciencedirect.com/science/bookseries/03040208/102 |
Summary: |
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 i |
Carrier Form: | 1 online resource (ix, 187 pages) : illustrations. |
Bibliography: | Includes bibliographical references and index. |
ISBN: |
9780444876478 0444876472 9780080872131 0080872131 |
Index Number: | QA267 |
CLC: | O141.3-532 |
Contents: | Front Cover; Topics in the Theory of Computation; Copyright Page; Preface; Table of Contents; Chapter 1. Input-driven Languages are recognized in log n space; Chapter 2. Constructive mathematics as a programming logic I: Some principles of theory; Chapter 3. Space and reversal complexity of probabilistic one-way Turing machines; Chapter 4. Recurring dominoes: Making the highly undecidable highly understandable; Chapter 5. A new transformational approach to partial correctness proof calculi for algol 68-like programs with finite modes and simple sideeffects. |