01797nam a2200385 a 4500001001000000003000700010005001700017006001900034007001500053008004100068020001500109020001800124020003500142035002200177035002300199035002500222035002300247035002100270040002700291050002100318245011500339260004900454300003400503504005300537505037200590533014700962650003401109650003701143650003201180655002901212700002701241710002801268856009601296999001901392EBC737647MiAaPQ20250821114411.0m     o  d |      cr cn|||||||||110714s2011    njuac   sb    001 0 eng d  z9814327743  z9789814327749  a9789814327756 (electronic bk.)  a(MiAaPQ)EBC737647  a(Au-PeEL)EBL737647  a(CaPaEBR)ebr10479798  a(CaONFJC)MIL314860  a(OCoLC)742640331  aMiAaPQcMiAaPQdMiAaPQ 4aQA274b.R36 201100aRandomness through computationh[electronic resource] :bsome answers, more questions /ceditor, Hector Zenil.  aHackensack, N.J. :bWorld Scientific,c2011.  axviii, 419 p. :bill., ports.  aIncludes bibliographical references and indexes.0 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).  aElectronic reproduction. Ann Arbor, MI : ProQuest, 2015. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries. 0aStochastic processes.9348999 0aComputational complexity.936729 0aRandom polynomials.9349000 4aElectronic books.9351421 aZenil, Hector.93490012 aProQuest (Firm)934900240uhttps://ebookcentral.proquest.com/lib/kuct-ebooks/detail.action?docID=737647zClick to View  c274207d274207