{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T18:02:23Z","timestamp":1784484143133,"version":"3.55.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032313478","type":"print"},{"value":"9783032313485","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T00:00:00Z","timestamp":1784505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T00:00:00Z","timestamp":1784505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2027]]},"DOI":"10.1007\/978-3-032-31348-5_8","type":"book-chapter","created":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T17:29:05Z","timestamp":1784482145000},"page":"124-134","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bishop\u2019s (Up)Crossing Inequality and\u00a0Lower Semicomputable Random Reals Revisited"],"prefix":"10.1007","author":[{"given":"Mikhail","family":"Andreev","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8605-7734","authenticated-orcid":false,"given":"Alexander","family":"Shen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,20]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"Barmpalias, G., Lewis-Pye, A.: Differences of halting probabilities. J. Comput. Syst. Sci. 89, 349\u2013360 (2017). https:\/\/doi.org\/10.1016\/j.jcss.2017.06.002. https:\/\/arxiv.org\/abs\/1604.00216v2","DOI":"10.1016\/j.jcss.2017.06.002"},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"Bishop, E.: An upcrossing inequality with application. Michigan Math. J. 13(1), 1\u201313 (1966). https:\/\/doi.org\/10.1307\/mmj\/1028999474","DOI":"10.1307\/mmj\/1028999474"},{"key":"8_CR3","unstructured":"Bishop, E.: Foundations of Constructive Analysis. Mc-Graw Hill (1967). https:\/\/archive.org\/details\/foundationsofcon0000bish"},{"key":"8_CR4","unstructured":"Bishop, E.: A constructive ergodic theorem. J. Math. Mech. 17(7), 631\u2013639 (1968). http:\/\/www.jstor.org\/stable\/24901875"},{"issue":"1\u20132","key":"8_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0304-3975(99)00159-0","volume":"255","author":"CS Calude","year":"2001","unstructured":"Calude, C.S., Hertling, P.H., Khoussainov, B., Wang, Y.: Recursively enumerable reals and Chaitin $$ {\\Omega } $$ numbers. Theor. Comput. Sci. 255(1\u20132), 125\u2013149 (2001). https:\/\/doi.org\/10.1016\/S0304-3975(99)00159-0","journal-title":"Theor. Comput. Sci."},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Ku\u010dera, A., Slaman, T.A.: Randomness and recursive enumerability. SIAM J. Comput. 31(1), 199\u2013211 (2001). https:\/\/doi.org\/10.1137\/S0097539799357441","DOI":"10.1137\/S0097539799357441"},{"key":"8_CR7","doi-asserted-by":"publisher","unstructured":"Miller, J.S.: On work of Barmpalias and Lewis-Pye: a derivation on the D.C.E. reals. In: Day, A., Fellows, M., Greenberg, N., Khoussainov, B., Melnikov, A., Rosamond, F. (eds.) Computability and Complexity. LNCS, vol. 10010, pp. 644\u2013659. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-50062-1_39","DOI":"10.1007\/978-3-319-50062-1_39"},{"key":"8_CR8","doi-asserted-by":"publisher","unstructured":"Shen, A.: Ergodic theorem and algorithmic randomness (following V.V\u2019yugin). Inf. Comput. 307, 105375 (2025). https:\/\/doi.org\/10.1016\/j.ic.2025.105375. https:\/\/arxiv.org\/abs\/2306.12769","DOI":"10.1016\/j.ic.2025.105375"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Shen, A., Uspensky, V.A., Vereshchagin, N.: Kolmogorov complexity and algorithmic randomness. In: Mathematical Surveys and Monographs, vol. 220. American Mathematical Society, Providence (2018). https:\/\/www.lirmm.fr\/~ashen\/kolmbook-eng-scan.pdf","DOI":"10.1090\/surv\/220"},{"key":"8_CR10","doi-asserted-by":"publisher","unstructured":"Titov, I.: Extending the Barmpalias\u2013Lewis-Pye limit theorem to all reals. J. Symb. Logic (2025). https:\/\/doi.org\/10.1017\/jsl.2025.10157. Accessed 28 Oct 2025","DOI":"10.1017\/jsl.2025.10157"},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"Titov, I.: Relative randomness and continuous translation functions. In: 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025), Warsaw, Poland, August 2025, p. 91 (2025). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2025.91. https:\/\/drops.dagstuhl.de\/entities\/document\/10.4230\/LIPIcs.MFCS.2025.91","DOI":"10.4230\/LIPIcs.MFCS.2025.91"},{"issue":"2","key":"8_CR12","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0304-3975(98)00072-3","volume":"207","author":"V Vladimir","year":"1998","unstructured":"Vladimir, V.: V\u2019yugin, Ergodic theorems for individual random sequences. Theor. Comput. Sci. 207(2), 343\u2013361 (1998). https:\/\/doi.org\/10.1016\/S0304-3975(98)00072-3","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Timeless Machines: Computability Across Eras"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-31348-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T17:29:06Z","timestamp":1784482146000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-31348-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,20]]},"ISBN":["9783032313478","9783032313485"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-31348-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,20]]},"assertion":[{"value":"20 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Authors declare no competing interests.","order":1,"name":"Ethics","label":"Disclosure of Interests","group":{"name":"EthicsHeading","label":"Ethics"}},{"value":"CiE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Computability in Europe","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}