default search action
60. Birthday: Cristian S. Calude 2012
- Michael J. Dinneen, Bakhadyr Khoussainov, André Nies:
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. Lecture Notes in Computer Science 7160, Springer 2012, ISBN 978-3-642-27653-8
Life Story
- Solomon Marcus:
The Art of Reaching the Age of Sixty. 1-19 - Hermann A. Maurer:
Calude as Father of One of the Computer Science Journals. 20-30
Complexity, Computability and Randomness
- Laurent Bienvenu, Alexander Shen
:
Random Semicomputable Reals Revisited. 31-45 - Douglas S. Bridges, Luminita Vîta:
Constructing the Infimum of Two Projections. 46-58 - Paul Brodhead, Rod Downey, Keng Meng Ng
Bounded Randomness. 59-70 - Cezar Câmpeanu
A Note on Blum Static Complexity Measures. 71-80 - Michael J. Dinneen
A Program-Size Complexity Measure for Mathematical Problems and Conjectures. 81-93 - Monica Dumitrescu:
On Degrees of Randomness and Genetic Randomness. 94-104 - Rusins Freivalds:
Hartmanis-Stearns Conjecture on Real Time and Transcendence. 105-119 - Ziyuan Gao, Frank Stephan
Learning Families of Closed Sets in Matroids. 120-139 - Helmut Jürgensen:
Invariance and Universality of Complexity. 140-158 - Antonín Kucera
Demuth's Path to Randomness. 159-173 - Yuri I. Manin:
A Computability Challenge: Asymptotic Bounds for Error-Correcting Codes. 174-182 - Jacques Patarin:
Some Transfinite Generalisations of Gödel's Incompleteness Theorem. 183-193 - Ludwig Staiger:
On Oscillation-Free Chaitin h-Random Sequences. 194-202 - Kohtaro Tadaki:
Phase Transition between Unidirectionality and Bidirectionality. 203-223 - Hector Zenil
Computer Runtimes and the Length of Proofs - With an Algorithmic Probabilistic Application to Waiting Times in Automatic Theorem Proving. 224-240 - Marius Zimand:
Symmetry of Information: A Closer Look. 241-246
Physics, Philosophy and Computation
- Gregory J. Chaitin:
How Much Information Can There Be in a Real Number? 247-251 - S. Barry Cooper:
Mathematics, Metaphysics and the Multiverse. 252-267 - V. Kruglov, K. A. Makarov, B. Pavlov, Adil Yafyasov
Exponential Decay in Quantum Mechanics. 268-288 - Giuseppe Longo, Maël Montévil
Randomness Increases Order in Biological Evolution. 289-308 - Karl Svozil
Haunted Quantum Contextuality versus Value Indefiniteness. 309-314 - Stephen Wolfram:
Is the Universe Like π or Ω? 315-319
Algorithms, Automata and Formal Models
- Md. Ashraful Alam, Igor Rivin, Ileana Streinu:
Outerplanar Graphs and Delaunay Triangulations. 320-329 - Robert Brijder
Representing Reaction Systems by Trees. 330-342 - Haiming Chen, Sheng Yu:
Derivatives of Regular Expressions and an Application. 343-356 - Lila Kari, Shinnosuke Seki, Zhi Xu:
Triangular and Hexagonal Tile Self-assembly Systems. 357-375 - Gheorghe Paun, Mario J. Pérez-Jiménez
dP Automata versus Right-Linear Simple Matrix Grammars. 376-387 - Xiaoxue Piao, Kai Salomaa:
State Complexity of Kleene-Star Operations on Trees. 388-402 - Arto Salomaa:
Composition Sequences and Synchronizing Automata. 403-416 - Ioan Tomescu
On the Connected Partition Dimension of a Wheel Related Graph. 417-424
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-13 18:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: