Computation, Physics And Beyond International Workshop On Theoretical Computer Science, Wtcs 2012, Dedicated To Cristian S Calude On The Occasion Of 7160 Lecture Notes In Computer Science
Michael J. Dinneen
The Art of Reaching the Age of Sixty.- Calude as Father of One of the Computer Science Journals.- Random Semicomputable Reals Revisited.- Constructing the In mum of Two Projections.- Bounded Randomness.- A Note on Blum Static Complexity Measures.- A Program-Size Complexity Measure for Mathematical Problems and Conjectures.- On Degrees of...
Resumo
The Art of Reaching the Age of Sixty.- Calude as Father of One of the Computer Science Journals.- Random Semicomputable Reals Revisited.- Constructing the In mum of Two Projections.- Bounded Randomness.- A Note on Blum Static Complexity Measures.- A Program-Size Complexity Measure for Mathematical Problems and Conjectures.- On Degrees of Randomness and Genetic Randomness.- Hartmanis-Stearns Conjecture on Real Time and Transcendence.- Learning Families of Closed Sets in Matroids.- Invariance and Universality of Complexity.- Demuth's Path to Randomness (extended abstract).- Correcting Codes.- Some Transfinite Generalisations of Gödel's Incompleteness Theorem.- Phase Transition between Unidirectionality and Bidirectionality.- Computer Runtimes and the Length of Proofs.- Symmetry of Information: A Closer Look.- How Much Information Can There Be in a Real Number?.- Mathematics, Metaphysics and the Multiverse.- Exponential Decay in Quantum Mechanics.- Randomness Increases Order in Biological Evolution.- Haunted Quantum Contextuality Versus Value Indefiniteness.- Outerplanar Graphs and Delaunay Triangulations.- Representing Reaction Systems by Trees.- Derivatives of Regular Expressions and An Application.- Triangular and Hexagonal Tile Self-Assembly Systems.- dP Automata versus Right-Linear Simple Matrix Grammars.- State Complexity of Kleene-Star Operations on Trees.- Composition Sequences and Synchronizing Automata.- On the Connected Partition Dimension of a Wheel Related Graph.
Nº de Páginas:
Encadernação: Capa Mole / Paperback
Tema: Algorithms & data structures
Avaliações dos nossos clientes
Sê o primeiro a dar
a tua opinião sobre este produto
Características
- Editora
-
Springer
- Idiomas
-
Inglês
- Data de lançamento
-
18/01/2012
- Peso
-
670,0
- Colecção
-
Algorithms & data structures
- Série/Edição Limitada
-
2012
- EAN
-
9783642276538