Topics in the Theory of Computation
- 1st Edition, Volume 24 - April 23, 2012
- Imprint: North Holland
- Editors: M. Karpinski, J. van Leeuwen
- Language: English
- Hardback ISBN:9 7 8 - 0 - 4 4 4 - 8 7 6 4 7 - 8
- Paperback ISBN:9 7 8 - 0 - 4 4 4 - 5 5 8 0 0 - 8
- eBook ISBN:9 7 8 - 0 - 0 8 - 0 8 7 2 1 3 - 1
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… Read more
Purchase options
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).
- Edition: 1
- Volume: 24
- Published: April 23, 2012
- Imprint: North Holland
- Language: English
Jv
J. van Leeuwen
Jan van Leeuwen is professor at the Department of Information and Computing Sciences at Utrecht University. He received a Ph.D. in mathematics in 1972 from the same institution. After having held several positions in computer science in the US, he returned to Utrecht as a faculty member in 1977. He was head of department from 1977 to 1983 and from 1991 to 1994, and served as dean from 1994 to 2009. His research interests extend to many branches of the theory and philosophy of computer science. He is a member of the Academia Europae, is the first recipient of a Distinguished Lorentz Fellowship Prize in the Netherlands, and holds an honorary doctorate from RWTH Aachen University. For more information, http://www.cs.uu.nl/staff/jan.html.
Affiliations and expertise
Professor of Computing Science, Utrecht University, The NetherlandsRead Topics in the Theory of Computation on ScienceDirect