{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T10:17:50Z","timestamp":1776421070118,"version":"3.51.2"},"reference-count":17,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":284,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[2013,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We introduce martingales defined by probabilistic strategies, in which randomness is used to decide whether to bet. We show that different criteria for the success of computable probabilistic strategies can be used to characterize ML-randomness, computable randomness, and partial computable randomness. Our characterization of ML-randomness partially addresses a critique of Schnorr by formulating ML randomness in terms of a computable process rather than a computably enumerable function.<\/jats:p>","DOI":"10.2178\/jsl.7802130","type":"journal-article","created":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T10:11:08Z","timestamp":1368612668000},"page":"579-601","source":"Crossref","is-referenced-by-count":3,"title":["Probabilistic Algorithmic Randomness"],"prefix":"10.1017","volume":"78","author":[{"given":"Sam","family":"Buss","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mia","family":"Minnes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200000153_ref016","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0112458"},{"key":"S0022481200000153_ref015","doi-asserted-by":"publisher","DOI":"10.1007\/BF01694181"},{"key":"S0022481200000153_ref014","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199230761.001.0001"},{"key":"S0022481200000153_ref013","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00069-3"},{"key":"S0022481200000153_ref012","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2005.06.011"},{"key":"S0022481200000153_ref011","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-005-1212-8"},{"key":"S0022481200000153_ref008","first-page":"1413","article-title":"On the notion of a random sequence","volume":"14","author":"Levin","year":"1973","journal-title":"Soviet Mathematics Doklady"},{"key":"S0022481200000153_ref006","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-005-1135-4"},{"key":"S0022481200000153_ref005","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804106"},{"key":"S0022481200000153_ref003","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090"},{"key":"S0022481200000153_ref001","first-page":"33","volume-title":"Language, logic, and formalization of knowledge","author":"Ambos-Spies","year":"1998"},{"key":"S0022481200000153_ref007","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.09.036"},{"key":"S0022481200000153_ref017","first-page":"378","article-title":"Process complexity and effective random tests","volume":"5","author":"Schnorr","year":"1973","journal-title":"Journal of Computer and System Sciences"},{"key":"S0022481200000153_ref004","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68441-3"},{"key":"S0022481200000153_ref010","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(66)80018-9"},{"key":"S0022481200000153_ref002","first-page":"1","volume-title":"Computability theory and its applications","author":"Ambos-Spies","year":"2000"},{"key":"S0022481200000153_ref009","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-49820-1"}],"container-title":["The Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200000153","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T17:40:15Z","timestamp":1556041215000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200000153\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["S0022481200000153"],"URL":"https:\/\/doi.org\/10.2178\/jsl.7802130","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6]]}}}