|
|
|
|
LEADER |
00000cam a2200000Ma 4500 |
001 |
EBOOKCENTRAL_ocn646768478 |
003 |
OCoLC |
005 |
20240329122006.0 |
006 |
m o d |
007 |
cr cn||||||||| |
008 |
071006s2007 si a ob 010 0 eng d |
010 |
|
|
|a 2008295620
|
040 |
|
|
|a E7B
|b eng
|e pn
|c E7B
|d OCLCQ
|d N$T
|d UBY
|d IDEBK
|d OCLCQ
|d OCLCF
|d OCLCQ
|d YDXCP
|d MHW
|d EBLCP
|d DEBSZ
|d OCLCQ
|d COCUF
|d AGLDB
|d MOR
|d PIFAG
|d ZCU
|d OCLCQ
|d MERUC
|d OCLCQ
|d U3W
|d STF
|d WRM
|d OCLCQ
|d VTS
|d NRAMU
|d ICG
|d INT
|d VT2
|d OCLCQ
|d WYU
|d JBG
|d OCLCQ
|d DKC
|d AU@
|d OCLCQ
|d M8D
|d UKAHL
|d OCLCQ
|d LEAUB
|d UKCRE
|d AJS
|d OCLCO
|d OCLCQ
|d OCLCO
|d OCLCL
|
019 |
|
|
|a 262527330
|a 505147612
|a 748531118
|a 815748061
|a 879025560
|a 961626625
|a 962691390
|a 988495705
|a 991962332
|a 1037715431
|a 1038648379
|a 1045476606
|a 1055355735
|a 1064634008
|a 1081217305
|a 1086501683
|a 1153523207
|a 1228529726
|
020 |
|
|
|a 9789812770837
|q (electronic bk.)
|
020 |
|
|
|a 9812770836
|q (electronic bk.)
|
020 |
|
|
|a 1281911607
|
020 |
|
|
|a 9781281911605
|
020 |
|
|
|z 9812770828
|
020 |
|
|
|z 9789812770820
|
029 |
1 |
|
|a AU@
|b 000051406548
|
029 |
1 |
|
|a AU@
|b 000058360852
|
029 |
1 |
|
|a DEBBG
|b BV043152849
|
029 |
1 |
|
|a DEBBG
|b BV044179630
|
029 |
1 |
|
|a DEBSZ
|b 405249098
|
029 |
1 |
|
|a DEBSZ
|b 422096083
|
029 |
1 |
|
|a NZ1
|b 13518416
|
035 |
|
|
|a (OCoLC)646768478
|z (OCoLC)262527330
|z (OCoLC)505147612
|z (OCoLC)748531118
|z (OCoLC)815748061
|z (OCoLC)879025560
|z (OCoLC)961626625
|z (OCoLC)962691390
|z (OCoLC)988495705
|z (OCoLC)991962332
|z (OCoLC)1037715431
|z (OCoLC)1038648379
|z (OCoLC)1045476606
|z (OCoLC)1055355735
|z (OCoLC)1064634008
|z (OCoLC)1081217305
|z (OCoLC)1086501683
|z (OCoLC)1153523207
|z (OCoLC)1228529726
|
050 |
|
4 |
|a QA267.7
|b .R36 2007eb
|
072 |
|
7 |
|a MAT
|x 029000
|2 bisacsh
|
072 |
|
7 |
|a PBH
|2 bicssc
|
082 |
0 |
4 |
|a 519.2
|2 22
|
049 |
|
|
|a UAMI
|
245 |
0 |
0 |
|a Randomness and complexity :
|b from Leibniz to Chaitin /
|c editor, Cristian S. Calude.
|
260 |
|
|
|a Singapore ;
|a Hackensack, NJ :
|b World Scientific,
|c ©2007.
|
300 |
|
|
|a 1 online resource (xviii, 445 pages) :
|b illustrations
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
504 |
|
|
|a Includes bibliographical references.
|
505 |
0 |
|
|a Cover -- Contents -- Preface -- Technical Contributions -- 1. On Random and Hard-to-Describe Numbers Charles H. Bennett -- 1. Berrys Paradox and the Unprovability of Randomness -- 2. The Search for a 8220;Random Real Number -- References -- 2. Computing Beyond Classical Logic: SVD Computation in Nonassociative Dickson Algebras Fran184;coise Chaitin-Chatelin -- 2.1. Introduction -- 2.2. Nonassociativity of multiplication -- 2.3. Nonassociative Dickson algebras -- 2.4. SVD computation in Dk and Ak, k 3 -- 2.5. Is the nonclassical SVD derivation absurd? -- 2.6. Conclusion -- Acknowledgement -- References -- 3. JanusFaced Physics: On Hilberts 6th Problem N.C.A. da Costa and F.A. Doria -- 3.1. Prologue -- 3.2. Hilberts 6th Problem -- 3.3. A review of axiomatization techniques -- 3.4. Structures, species of structures, models -- 3.5. Axiomatization in mathematics -- 3.6. Suppes predicates for classical field theories in physics -- 3.7. Generalized incompleteness -- 3.8. Higher degrees -- 3.9. The function and the arithmetical hierarchy -- 3.10. First applications: mechanics and chaos theory -- 3.11. Janusfaced physics -- Acknowledgments -- References -- 4. The Implications of a Cosmological Information Bound for Complexity, Quantum Information and the Nature of Physical Law P.C.W. Davies -- 4.1. What are the laws of physics? -- 4.2. Laws as software -- 4.3. The quantum vacuum -- 4.4. Quantum information processing -- 4.5. Unfinished business -- Acknowledgments -- Footnotes -- 5. What Is a Computation? Martin Davis -- The Turing Post Language -- Codes for Turing Post Programs -- The Universal Program -- The Halting Problem -- Other Unsolvable Problems -- Undecidable Statements -- Complexity and Randomness -- Unsolvability of Halting Problem -- An Unsolvable Word Problem -- 6. On the Kolmogorov-Chaitin Complexity for Short Sequences Jean-Paul Delahaye and Hector Zenil -- References -- 7. Circuit Universality of Two Dimensional Cellular Automata: A Review A. Gajardo and E. Goles -- 7.1. Introduction -- 7.2. Computing through signals -- 7.3. CA over a hexagonal grid and three states -- 7.4. Life automata -- 7.5. Reversible models -- 7.6. Sandpiles -- 7.7. Conclusions -- Acknowledgments -- References -- 8. Chaitins Graph Coloring Algorithm James Goodman -- References -- 9. A Berry-type Paradox Gabriele Lolli -- References -- 10. in Number Theory Toby Ord and Tien D. Kieu -- 10.1. Recursive Enumerability, Algorithmic Randomness and -- 10.2. Diophantine Equations and Hilberts Tenth Problem -- 10.3. Expressing Omega Through Diophantine Equations -- References -- 11. The Secret Number. An Exposition of Chaitins Theory Grzegorz Rozenberg and Arto Salomaa -- 11.1. Introduction -- 11.2. Compressibility of information and randomness. An informal discussion -- 11.3. Prefix-freeness and Krafts inequality -- 11.4. Computer: a formal notion -- 11.5. Universal computer -- 11.6. Complexity -- 11.7. Fundamental inequalities -- 11.8. Computational and information-theoretic complexity -- 11.9. Self-delimiting programs -- 11.10. Randomness: intuitive considerations -- 11.11. Probability and complexity -- 11.12. Degree of randomness -- 11.13. Magic bits: pro.
|
520 |
|
|
|a The book is a collection of papers written by a selection of eminent authors from around the world in honour of Gregory Chaitin's 60th birthday. This is a unique volume including technical contributions, philosophical papers and essays.
|
588 |
0 |
|
|a Print version record.
|
590 |
|
|
|a eBooks on EBSCOhost
|b EBSCO eBook Subscription Academic Collection - Worldwide
|
590 |
|
|
|a ProQuest Ebook Central
|b Ebook Central Academic Complete
|
650 |
|
0 |
|a Kolmogorov complexity.
|
650 |
|
0 |
|a Computational complexity.
|
650 |
|
0 |
|a Stochastic processes.
|
650 |
|
6 |
|a Complexité de Kolmogorov.
|
650 |
|
6 |
|a Complexité de calcul (Informatique)
|
650 |
|
6 |
|a Processus stochastiques.
|
650 |
|
7 |
|a MATHEMATICS
|x Probability & Statistics
|x General.
|2 bisacsh
|
650 |
|
7 |
|a Computational complexity
|2 fast
|
650 |
|
7 |
|a Kolmogorov complexity
|2 fast
|
650 |
|
7 |
|a Stochastic processes
|2 fast
|
700 |
1 |
|
|a Calude, Cristian,
|d 1952-
|1 https://id.oclc.org/worldcat/entity/E39PBJpPFVbTHK68H4by4Byjmd
|
700 |
1 |
|
|a Chaitin, Gregory J.
|
758 |
|
|
|i has work:
|a Randomness and complexity (Text)
|1 https://id.oclc.org/worldcat/entity/E39PCGvgWDVybxYHqFydmKqwyd
|4 https://id.oclc.org/worldcat/ontology/hasWork
|
776 |
0 |
8 |
|i Print version:
|t Randomness and complexity.
|d Singapore ; Hackensack, NJ : World Scientific, ©2007
|z 9812770828
|z 9789812770820
|w (DLC) 2008295620
|w (OCoLC)173808093
|
856 |
4 |
0 |
|u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=1681697
|z Texto completo
|
938 |
|
|
|a Askews and Holts Library Services
|b ASKH
|n AH24684284
|
938 |
|
|
|a ProQuest Ebook Central
|b EBLB
|n EBL1681697
|
938 |
|
|
|a ebrary
|b EBRY
|n ebr10255618
|
938 |
|
|
|a EBSCOhost
|b EBSC
|n 235994
|
938 |
|
|
|a ProQuest MyiLibrary Digital eBook Collection
|b IDEB
|n 191160
|
938 |
|
|
|a YBP Library Services
|b YANK
|n 2891937
|
994 |
|
|
|a 92
|b IZTAP
|