LEADER 02741nam  2200613 a 450 
001 9910781203103321
005 20230725050530.0
010   $a1-283-14860-9
010   $a9786613148605
010   $a981-4327-75-1
035   $a(CKB)2550000000039729
035   $a(EBL)737647
035   $a(OCoLC)742640331
035   $a(SSID)ssj0000525196
035   $a(PQKBManifestationID)12251770
035   $a(PQKBTitleCode)TC0000525196
035   $a(PQKBWorkID)10488348
035   $a(PQKB)10252859
035   $a(MiAaPQ)EBC737647
035   $a(WSP)00007973
035   $a(Au-PeEL)EBL737647
035   $a(CaPaEBR)ebr10479798
035   $a(CaONFJC)MIL314860
035   $a(EXLCZ)992550000000039729
100   $a20110714d2011      uy             0
101 0 $aeng
135   $aur|n|---|||||
181   $ctxt
182   $cc
183   $acr
200 00$aRandomness through computation$b[electronic resource] $esome answers, more questions /$feditor, Hector Zenil
210   $aHackensack, N.J. $cWorld Scientific$d2011
215   $a1 online resource (439 p.)
300   $aDescription based upon print version of record.
311   $a981-4327-74-3 
320   $aIncludes bibliographical references and indexes.
327   $apt. 1. Stochastic randomness and probabilistic deliberations -- pt. 2. Randomness and computation in connection to the physical world -- pt. 3. Algorithmic inference and artificial intelligence -- pt. 4. Randomness, information and computability -- pt. 5. Computational complexity, randomized algorithms and applications -- pt. 6. Pannel discussions (transcriptions).
330   $aThis review volume consists of an indispensable set of chapters written by leading scholars, scientists and researchers in the field of Randomness, including related subfields specially but not limited to the strong developed connections to the Computability and Recursion Theory. Highly respected, indeed renowned in their areas of specialization, many of these contributors are the founders of their fields. The scope of ""Randomness Through Computation"" is novel. Each contributor shares his personal views and anecdotes on the various reasons and motivations which led him to the study of the su
606   $aStochastic processes
606   $aComputational complexity
606   $aRandom polynomials
615  0$aStochastic processes.
615  0$aComputational complexity.
615  0$aRandom polynomials.
676   $a003.54
676   $a519.2
701   $aZenil$b Hector$01091232
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910781203103321
996   $aRandomness through computation$93691546
997   $aUNINA