| Description |
1 online resource (xi, 424 pages) : illustrations |
| Series |
Lecture notes in computer science, 0302-9743 ; 7160 |
|
LNCS Sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science. Festschrift |
|
Lecture notes in computer science ; 7160.
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
|
Lecture notes in computer science. Festschrift.
|
| Contents |
The art of reaching the age of sixty / Solomon Marcus -- Calude as father of one of the computer science journals / Hermann Mauer -- Random semicomputable reals revisited / Laurent Bienvenu and Alexander Shen -- Constructing the infimum of two projections / Douglas S. Bridges and Luminita S. Vîţă -- Bounded randomness / Paul Brodhead, Rod Downey, and Keng Meng Ng -- A note on blum static complexity measures / Cezar Câmpeanu -- A program-size complexity measure for mathematical problems and conjectures / Michael J. Dinneen -- On degrees of randomness and genetic randomness / Monica Dumitrescu -- Hartmanis-Stearns conjecture on real time and transcendence / Rūsin̦š Freivalds -- Learning families of closed sets in matroids / Ziyuan Gao, Frank Stephan, Guohua Wu, and Akihiro Yamamoto -- Invariance and universality of complexity / Helmut Jürgensen -- Demuth's path to randomness / Antonín Kuc̆era and André Nies -- A computability challenge: asymptotic bounds for error-correcting codes / Yuri I. Manin -- Some transfinite generalisations of Gödel's incompleteness theorem / Jacques Patarin -- On oscillation-free chaitin h-random sequences / Ludwig Staiger -- Phase transition between unidirectionality and bidirectionality / Koktaro Tadaki -- Computer runtimes and the length of proofs: with an algorithmic probabilistic application to waiting times in automatic theorem proving / Hector Zenil -- Symmetry of information: a closer look / Marius Zimand -- How much information can there be in a real number? / Gregory Chaitin -- Mathematics, metaphysics and the multiverse / S. Barry Cooper -- Exponential decay in quantum mechanics / V. Kruglov, K.A. Makarov, B. Pavlov, and A. Yafyasov -- Randomness increases order in biological evolution / Giuseppe Longo and Maël Montévil -- Haunted quantum contextuality versus value indefiniteness / Karl Svozil -- Is the Universe like [pie] or [omega]? / Stephen Wolfram -- Outerplanar graphs and Delaunay triangulations / Ashraful Alam, Igor Rivin, and Ileana Streinu -- Representing reaction systems by trees / R. Brijder, A. Ehrenfeucht, and G. Rozenberg -- Derivatives of regular expressions and an application / Haiming Chen and Sheng Yu -- Triangular and hexagonal tile self-assembly systems / Lila Kari, Shinnosuke Seki, and Zhi Xu -- dP automata versus right-linear simple matrix grammars / Gheorghe Păun and Mario J. Pérez-Jiménez -- State complexity of Kleene-Star operations on trees / Xiaoxue Piao and Kai Salomaa -- Composition sequences and synchronizing automata / Arto Salomaa -- On the connected partition dimension of a wheel related graph / Ioan Tomescu |
| Summary |
Annotation 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, Kuera, 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) |
| Analysis |
Computer science |
|
Information theory |
|
Computer software |
|
Logic design |
|
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 |
| Bibliography |
Includes bibliographical references and author index |
| Subject |
Computer science -- Congresses
|
|
Computer logic -- Congresses
|
|
Computer science -- Mathematics -- Congresses
|
|
Informatique.
|
|
Computer logic
|
|
Computer science
|
|
Computer science -- Mathematics
|
| Genre/Form |
Conference papers and proceedings
|
|
Software.
|
| Form |
Electronic book
|
| Author |
Dinneen, M. J
|
|
Khoussainov, Bakhadyr, 1961-
|
|
Nies, André.
|
| ISBN |
9783642276545 |
|
3642276547 |
|
3642276539 |
|
9783642276538 |
|
