Computation, Physics and Beyond: International Workshop on Theoretical Computer Science, WTCS 2012, Dedicated to Cristian S. Calude on the Occasion of His 60th Birthday, Auckland, New Zealand, February 21-24, 2012, Revised Selected and Invited Papers

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This Festschrift volume has been published in honor of Cristian Calude on the occasion of his 60th birthday and contains contributions from invited speakers and regular papers presented at the International Workshop on Theoretical Computer Science, WTCS 2012, held in Auckland, New Zealand, in February 2012.

Cristian Calude has made a significant contribution to research in computer science theory. Along with early work by Chaitin, Kučera, Kurtz, Solovay, and Terwijn his papers published in the mid-1990s jointly with Khoussainov, Hertling, and Wang laid the foundation for the development of modern theory of algorithmic randomness. His work was essential for establishing the leading role of New Zealand in this area.

The research interests of Cristian Calude are reflected in the topics covered by the 32 papers included in this book, namely: algorithmic information theory, algorithms, automata and formal languages, computing and natural sciences, computability and applications, logic and applications, philosophy of computation, physics and computation, and unconventional models of computation. They have been organized into four parts. The first part consists of papers discussing his life achievements. This is followed by papers in the three general areas of complexity, computability, and randomness; physics, philosophy (and logic), and computation; and algorithms, automata, and formal models (including unconventional computing).

Author(s): Solomon Marcus (auth.), Michael J. Dinneen, Bakhadyr Khoussainov, André Nies (eds.)
Series: Lecture Notes in Computer Science 7160
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2012

Language: English
Commentary: Incorrect bookmarks, font problems (with CMBX12 and CMR9), no cover, no pagination
Pages: 427
Tags: Algorithm Analysis and Problem Complexity; Mathematical Logic and Formal Languages; Computation by Abstract Devices; Logics and Meanings of Programs; Mathematics of Computing; Theory of Computation

Front Matter....Pages -
The Art of Reaching the Age of Sixty....Pages 1-19
Calude as Father of One of the Computer Science Journals....Pages 20-30
Random Semicomputable Reals Revisited....Pages 31-45
Constructing the Infimum of Two Projections....Pages 46-58
Bounded Randomness....Pages 59-70
A Note on Blum Static Complexity Measures....Pages 71-80
A Program-Size Complexity Measure for Mathematical Problems and Conjectures....Pages 81-93
On Degrees of Randomness and Genetic Randomness....Pages 94-104
Hartmanis-Stearns Conjecture on Real Time and Transcendence....Pages 105-119
Learning Families of Closed Sets in Matroids....Pages 120-139
Invariance and Universality of Complexity....Pages 140-158
Demuth’s Path to Randomness....Pages 159-173
A Computability Challenge: Asymptotic Bounds for Error-Correcting Codes....Pages 174-182
Some Transfinite Generalisations of Gödel’s Incompleteness Theorem....Pages 183-193
On Oscillation-Free Chaitin h -Random Sequences....Pages 194-202
Phase Transition between Unidirectionality and Bidirectionality....Pages 203-223
Computer Runtimes and the Length of Proofs....Pages 224-240
Symmetry of Information: A Closer Look....Pages 241-246
How Much Information Can There Be in a Real Number?....Pages 247-251
Mathematics, Metaphysics and the Multiverse....Pages 252-267
Exponential Decay in Quantum Mechanics....Pages 268-288
Randomness Increases Order in Biological Evolution....Pages 289-308
Haunted Quantum Contextuality versus Value Indefiniteness....Pages 309-314
Is the Universe Like π or Ω?....Pages 315-319
Outerplanar Graphs and Delaunay Triangulations....Pages 320-329
Representing Reaction Systems by Trees....Pages 330-342
Derivatives of Regular Expressions and an Application....Pages 343-356
Triangular and Hexagonal Tile Self-assembly Systems....Pages 357-375
dP Automata versus Right-Linear Simple Matrix Grammars....Pages 376-387
State Complexity of Kleene-Star Operations on Trees....Pages 388-402
Composition Sequences and Synchronizing Automata....Pages 403-416
On the Connected Partition Dimension of a Wheel Related Graph....Pages 417-424
Back Matter....Pages -