Topics in the theory of computation [electronic resource] : selected papers of the International Conference on "Foundations of Computation Theory", FCT '83, Borgholm, Sweden, August 21-27, 1983 / edited by Marek Karpinski and Jan van Leeuwen.
Material type:
TextSeries: Annals of discrete mathematics ; 24. | North-Holland mathematics studies ; 102.Publication details: Amsterdam ; New York : New York, N.Y. : North-Holland ; Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., 1985. Description: 1 online resource (ix, 187 p.) : illISBN: 9780444876478; 0444876472Subject(s): Computational complexity -- Congresses | Machine theory -- Congresses | Computer science -- Mathematics -- Congresses | Computational complexity | Computer science -- Mathematics | Machine theoryGenre/Form: Electronic books. | Conference proceedings.Additional physical formats: Print version:: Topics in the theory of computation.DDC classification: 511 LOC classification: QA267 | .I56 1983ebOnline resources: ScienceDirect | Volltext 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 in Computation Theory; 6. General Computability and Decidability; 7. Computational and Arithmetic Complexity; 8. Analysis of Algorithms and Feasible Computing.
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.
Includes bibliographical references and index.
Description based on print version record.
There are no comments on this title.