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
著者
書誌事項
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
（Annals of discrete mathematics, 24）（North-Holland mathematics studies, 102）
North-Holland , Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., 1985
- : ne
- : U.S. : pbk.
大学図書館所蔵 件 / 全50件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographies and index
内容説明・目次
内容説明
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.
目次
Preface (M. Karpinksi and J. Van Leeuwen). Input-Driven Languages are Recognized in log n Space (B. v. Braunmuehl and R. Verbeek). Constructive Mathematics as a Programming Logic I: Some Principles of Theory (R.L. Constable). Space and Reversal Complexity of Probabilistic One-Way Turing Machines (R. Freivalds). Recurring Dominoes: Making the Highly Undecidable Highly Understandable (D. Harel). A New Transformational Approach to Partial Correctness Proof Calculi for Algol 68-like Programs with Finite Modes and Simple Side Effects (H. Langmaack). Effective Determination of the Zeros of p-ADIC Exponential Functions (A. MacIntyre). The Logic of Games and Its Applications (R. Parikh). A Fast Parallel Construction of Disjoint Paths in Networks (E. Shamir and E. Upfal). Descriptional Complexity for Classes of Ianov-Schemes (P. Trum and D. Wotschke).
「Nielsen BookData」 より