295 | -- | 297 | Arnold Beckmann, Benedikt Löwe. Computability in Europe 2006 |
298 | -- | 321 | Rose H. Abdul Rauf, Ulrich Berger, Anton Setzer. A Provably Correct Translation of the ::::lambda:::: -Calculus into a Mathematical Model of C++ |
322 | -- | 361 | Erika Ãbrahám, Andreas Grüner, Martin Steffen. Abstract Interface Behavior of Object-Oriented Languages with Monitors |
362 | -- | 393 | Roland Carl Backhouse, Henk Doornbos. Datatype-Generic Termination Proofs |
394 | -- | 409 | Ulrich Berger, Tie Hou. Coinduction for Exact Real Number Computation |
410 | -- | 424 | Jan A. Bergstra, John V. Tucker. Division Safe Calculation in Totalised Fields |
425 | -- | 463 | David Doty. Dimension Extractors and Optimal Decompression |
464 | -- | 470 | Christine Gaßner. A Hierarchy below the Halting Problem for Additive Machines |
471 | -- | 497 | John M. Hitchcock, MarÃa López-Valdés, Elvira Mayordomo. Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets |
498 | -- | 515 | Margarita V. Korovina, Nicolai Vorobjov. Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems |
516 | -- | 541 | Lars Kristiansen. Complexity-Theoretic Hierarchies Induced by Fragments of Gödel s ::::T:::: |
542 | -- | 562 | Johann A. Makowsky. From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials |
563 | -- | 582 | Alban Ponse, Mark van der Zwaag. Risk Assessment for One-Counter Threads |
583 | -- | 602 | Helmut Schwichtenberg. Realizability interpretation of proofs in constructive analysis |
603 | -- | 624 | Xizhong Zheng. Classification of Computably Approximable Real Numbers |