02774nam 2200625 a 450 991045626310332120200520144314.01-283-14860-99786613148605981-4327-75-1(CKB)2550000000039729(EBL)737647(OCoLC)742640331(SSID)ssj0000525196(PQKBManifestationID)12251770(PQKBTitleCode)TC0000525196(PQKBWorkID)10488348(PQKB)10252859(MiAaPQ)EBC737647(WSP)00007973(Au-PeEL)EBL737647(CaPaEBR)ebr10479798(CaONFJC)MIL314860(EXLCZ)99255000000003972920110714d2011 uy 0engur|n|---|||||txtccrRandomness through computation[electronic resource] some answers, more questions /editor, Hector ZenilHackensack, N.J. World Scientific20111 online resource (439 p.)Description based upon print version of record.981-4327-74-3 Includes bibliographical references and indexes.pt. 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).This 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 suStochastic processesComputational complexityRandom polynomialsElectronic books.Stochastic processes.Computational complexity.Random polynomials.003.54519.2Zenil Hector977971MiAaPQMiAaPQMiAaPQBOOK9910456263103321Randomness through computation2227941UNINA