×

Found 129 Documents (Results 1–100)

Computable randomness is about more than probabilities. (English) Zbl 1517.68149

Davis, Jesse (ed.) et al., Scalable uncertainty management. 14th international conference, SUM 2020, Bozen-Bolzano, Italy, September 23–25, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12322, 172-186 (2020).
MSC:  68Q30 60A99 60G48
PDFBibTeX XMLCite
Full Text: DOI arXiv

Deterministic randomness extraction from generalized and distributed Santha-Vazirani sources. (English) Zbl 1380.68182

Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part I. Berlin: Springer (ISBN 978-3-662-47671-0/pbk; 978-3-662-47672-7/ebook). Lecture Notes in Computer Science 9134, 143-154 (2015).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Diophantine properties of Brownian motion: recursive aspects. (English) Zbl 1315.68160

Brattka, Vasco (ed.) et al., Logic, computation, hierarchies. Dedicated to Victor L. Selivanov on the occasion of his 60th birthday. Berlin: De Gruyter (ISBN 978-1-61451-783-2/hbk; 978-1-61451-804-4/ebook). Ontos Mathematical Logic 4, 139-156 (2014).
PDFBibTeX XMLCite
Full Text: arXiv

Principles of Solomonoff induction and AIXI. (English) Zbl 1401.60066

Dowe, David L. (ed.), Algorithmic probability and friends. Bayesian prediction and artificial intelligence. Papers from the Ray Solomonoff 85th memorial conference, Melbourne, VIC, Australia, November 30 – December 2, 2011. Berlin: Springer (ISBN 978-3-642-44957-4/pbk). Lecture Notes in Computer Science 7070. Lecture Notes in Artificial Intelligence, 386-398 (2013).
MSC:  60G25 68Q30 68T05
PDFBibTeX XMLCite
Full Text: DOI arXiv

The semimeasure property of algorithmic probability – “feature” or “bug”? (English) Zbl 1401.60005

Dowe, David L. (ed.), Algorithmic probability and friends. Bayesian prediction and artificial intelligence. Papers from the Ray Solomonoff 85th memorial conference, Melbourne, VIC, Australia, November 30 – December 2, 2011. Berlin: Springer (ISBN 978-3-642-44957-4/pbk). Lecture Notes in Computer Science 7070. Lecture Notes in Artificial Intelligence, 79-90 (2013).
MSC:  60A99 68Q30 68T05
PDFBibTeX XMLCite
Full Text: DOI

Ray Solomonoff and the new probability. (English) Zbl 1407.68016

Dowe, David L. (ed.), Algorithmic probability and friends. Bayesian prediction and artificial intelligence. Papers from the Ray Solomonoff 85th memorial conference, Melbourne, VIC, Australia, November 30 – December 2, 2011. Berlin: Springer. Lect. Notes Comput. Sci. 7070, 37-52 (2013).
PDFBibTeX XMLCite
Full Text: DOI

Introduction to Ray Solomonoff 85th memorial conference. (English) Zbl 1403.68006

Dowe, David L. (ed.), Algorithmic probability and friends. Bayesian prediction and artificial intelligence. Papers from the Ray Solomonoff 85th memorial conference, Melbourne, VIC, Australia, November 30 – December 2, 2011. Berlin: Springer (ISBN 978-3-642-44957-4/pbk). Lecture Notes in Computer Science 7070. Lecture Notes in Artificial Intelligence, 1-36 (2013).
PDFBibTeX XMLCite
Full Text: DOI

Predictive complexity and generalized entropy rate of stationary ergodic processes. (English) Zbl 1386.68077

Bshouty, Nader H. (ed.) et al., Algorithmic learning theory. 23rd international conference, ALT 2012, Lyon, France, October 29–31, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-34105-2/pbk). Lecture Notes in Computer Science 7568. Lecture Notes in Artificial Intelligence, 365-379 (2012).
PDFBibTeX XMLCite
Full Text: DOI arXiv

On degrees of randomness and genetic randomness. (English) Zbl 1353.60005

Dinneen, Michael J. (ed.) et al., Computation, physics and beyond. International 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. Berlin: Springer (ISBN 978-3-642-27653-8/pbk). Lecture Notes in Computer Science 7160, 94-104 (2012).
PDFBibTeX XMLCite
Full Text: DOI

What is a random number? Chance and computability. (Qu’est-ce qu’un nombre aléatoire? Hasard et calculabilité.) (French. English summary) Zbl 1316.65006

Bienvenu, Laurent et al., Qu’est-ce qu’un nombre au hasard?. Paris: Société Mathématique de France (ISBN 978-2-85629-320-1/pbk). SMF Journée Annuelle 2011, 1-26 (2011).
MSC:  65C10 60G60
PDFBibTeX XMLCite

A Kolmogorov complexity proof of the Lovász local lemma for satisfiability. (English) Zbl 1353.68146

Fu, Bin (ed.) et al., Computing and combinatorics. 17th annual international conference, COCOON 2011, Dallas, TX, USA, August 14–16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22684-7/pbk). Lecture Notes in Computer Science 6842, 168-179 (2011).
MSC:  68Q30 60C05
PDFBibTeX XMLCite
Full Text: DOI

Complexity and stable evolution of circuits. (English) Zbl 1222.92002

Feferman, Solomon (ed.) et al., Proofs, categories and computations. Essays in honor of Grigori Mints. With the collaboration of Vladik Kreinovich, Vladimir Lifschitz, and Ruy de Queiroz. London: College Publications (ISBN 978-1-84890-012-7/pbk). Tributes 13, 279-296 (2010).
PDFBibTeX XMLCite

Members of random closed sets. (English) Zbl 1233.03049

Ambos-Spies, Klaus (ed.) et al., Mathematical theory and computational practice. 5th conference on computability in Europe, CiE 2009, Heidelberg, Germany, July 19–24, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03072-7/pbk). Lecture Notes in Computer Science 5635, 144-153 (2009).
MSC:  03D32 60C05 68Q30
PDFBibTeX XMLCite
Full Text: DOI

Instability, complexity, and evolution. (English. Russian original) Zbl 1211.37121

J. Math. Sci., New York 158, No. 6, 787-808 (2009); translation from Zap. Nauchn. Semin. POMI 360, 31-69 (2008).
PDFBibTeX XMLCite
Full Text: DOI

Effective randomness for computable probability measures. (English) Zbl 1262.03064

Cenzer, D. (ed.) et al., Proceedings of the 3rd international conference on computability and complexity in analysis (CCA 2006), Gainesville, FL, USA, November 1–5, 2006. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 167, 117-130 (2007).
PDFBibTeX XMLCite
Full Text: DOI

Some results on effective randomness. (English) Zbl 1099.03033

Díaz, Josep (ed.) et al., Automata, languages and programming. 31st international colloquium, ICALP 2004, Turku, Finland, July 12–16, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22849-7/pbk). Lecture Notes in Computer Science 3142, 983-995 (2004).
PDFBibTeX XMLCite
Full Text: DOI

An improvement of Kolmogorov’s estimates related to random number generators and a definition of randomness in terms of complexity. (English. Russian original) Zbl 1175.68210

Dokl. Math. 68, No. 1, 132-134 (2003); translation from Dokl. Akad. Nauk, Ross. Akad. Nauk 391, No. 6, 738-740 (2003).
MSC:  68Q30 60C05
PDFBibTeX XMLCite

Measuring sets in infinite groups. (English) Zbl 1022.20010

Gilman, Robert (ed.) et al., Computational and statistical group theory. Proceedings of the AMS special session on geometric group theory, Las Vegas, NV, USA, April 21-22, 2001 and the AMS special session on computational group theory, Hoboken, NJ, USA, April 28-29, 2001. Providence, RI: American Mathematical Society (AMS). Contemp. Math. 298, 21-42 (2002).
PDFBibTeX XMLCite
Full Text: arXiv

The Kolmogorov complexity of \(p\)-adic random sequences. (English) Zbl 0965.60009

Butzer, P. L. (ed.) et al., Karl der Große und sein Nachwirken. 1200 Jahre Kultur und Wissenschaft in Europa. Band 2: Mathematisches Wissen. Turnhout: Brepols. 531-539 (1998).
Reviewer: P.Lachout (Praha)
MSC:  60A99 11S80
PDFBibTeX XMLCite

Non-Kolmogorov probabilistic models with \(p\)-adic probabilities and foundations of quantum mechanics. (English) Zbl 0902.60004

Decreusefond, Laurent (ed.) et al., Stochastic analysis and related topics VI. Proceedings of the 6th Oslo-Silivri workshop, Geilo, Norway, July 29–August 6, 1996. Boston, MA: Birkhäuser. Prog. Probab. 42, 275-303 (1998).
Reviewer: P.Lachout (Praha)
MSC:  60A99
PDFBibTeX XMLCite

Randomness. (English) Zbl 0840.01025

Apt, Krzysztof (ed.) et al., From universal morphisms to megabytes: a Baayen space odyssey. On the occasion of the retirement of Prof. Dr. P.C. Baayen. Amsterdam: CWI, 627-642 (1995).
Reviewer: H.Grimm (Jena)
PDFBibTeX XMLCite

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

Software