000 05454nam a22006015i 4500
001 978-3-642-27654-5
003 DE-He213
005 20240423125948.0
007 cr nn 008mamaa
008 120215s2012 gw | s |||| 0|eng d
020 _a9783642276545
_9978-3-642-27654-5
024 7 _a10.1007/978-3-642-27654-5
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
245 1 0 _aComputation, Physics and Beyond
_h[electronic resource] :
_bInternational 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 /
_cedited by Michael J. Dinneen, Bakhadyr Khoussainov, Prof. Andre Nies.
250 _a1st ed. 2012.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2012.
300 _aXIII, 427 p. 64 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v7160
505 0 _aThe 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 ofInformation: 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.
520 _aThis 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).
650 0 _aAlgorithms.
650 0 _aMachine theory.
650 0 _aComputer science.
650 0 _aComputer science
_xMathematics.
650 1 4 _aAlgorithms.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aTheory of Computation.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aMathematics of Computing.
700 1 _aDinneen, Michael J.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aKhoussainov, Bakhadyr.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aNies, Prof. Andre.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642276538
776 0 8 _iPrinted edition:
_z9783642276552
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v7160
856 4 0 _uhttps://doi.org/10.1007/978-3-642-27654-5
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c183551
_d183551