{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T14:05:43Z","timestamp":1779977143951,"version":"3.53.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T00:00:00Z","timestamp":1779926400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T00:00:00Z","timestamp":1779926400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"University of Dallas"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2026,6]]},"abstract":"Abstract<\/jats:title>\n \n Prokhorov\u2019s Theorem in probability theory states that a family\n \n \n $$\\Gamma $$<\/jats:tex-math>\n \n \u0393<\/mml:mi>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n of probability measures on a Polish space is tight if and only if every sequence in\n \n \n $$\\Gamma $$<\/jats:tex-math>\n \n \u0393<\/mml:mi>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n has a weakly convergent subsequence. Due to the highly non-constructive nature of (relative) sequential compactness, however, the effective content of this theorem has not been studied. To this end, we generalize the effective notions of weak convergence of measures on the real line due to McNicholl and Rojas to computable Polish spaces. Then, we introduce an effective notion of tightness for families of measures on computable Polish spaces. Finally, we prove an effective version of Prokhorov\u2019s Theorem for computable sequences of probability measures.\n <\/jats:p>","DOI":"10.1007\/s00224-026-10282-x","type":"journal-article","created":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T13:40:32Z","timestamp":1779975632000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Effective Weak Convergence and Tightness of Measures in Computable Polish Spaces"],"prefix":"10.1007","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9878-6264","authenticated-orcid":false,"given":"Diego A.","family":"Rojas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,28]]},"reference":[{"issue":"52","key":"10282_CR1","first-page":"563","volume":"9","author":"A Alexandroff","year":"1941","unstructured":"Alexandroff, A.: Additive set-functions in abstract spaces. Matematicheskii Sbornik 9(52), 563\u2013628 (1941)","journal-title":"Matematicheskii Sbornik"},{"key":"10282_CR2","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/j.apal.2011.10.006","volume":"163","author":"V Brattka","year":"2012","unstructured":"Brattka, V., Gherardi, G., Marcone, A.: The Bolzano-Weierstrass Theorem is the jump of Weak K\u00f6nig\u2019s Lemma. Ann. Pure Appl. Logic 163, 623\u2013655 (2012)","journal-title":"Ann. Pure Appl. Logic"},{"key":"10282_CR3","volume-title":"Handbook of Computability and Complexity in Analysis","year":"2021","unstructured":"Brattka, V., Hertling, P. (eds.): Handbook of Computability and Complexity in Analysis. Theory and Applications of Computability. Springer, Cham (2021)"},{"key":"10282_CR4","volume-title":"Computability Theory","author":"SB Cooper","year":"2004","unstructured":"Cooper, S.B.: Computability Theory. Chapman & Hall\/CRC, Boca Raton, FL (2004)"},{"issue":"1","key":"10282_CR5","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.tcs.2005.03.054","volume":"341","author":"P G\u00e1cs","year":"2005","unstructured":"G\u00e1cs, P.: Uniform test of algorithmic randomness over a general space. Theoret. Comput. Sci. 341(1), 91\u2013137 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"10282_CR6","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-03073-4_27","volume":"5635","author":"M Hoyrup","year":"2009","unstructured":"Hoyrup, M., Rojas, C.: An application of Martin-L\u00f6f randomness to effective probability theory. Lect. Notes Comput. Sci. 5635, 260\u2013269 (2009)","journal-title":"Lect. Notes Comput. Sci."},{"key":"10282_CR7","doi-asserted-by":"crossref","unstructured":"Hoyrup, M., Rojas, C.: Applications of effective probability theory to Martin-L\u00f6f Randomness. In: International Colloquium on Automata, Languages and Programming, volume 5555 of Lecture Notes in Computer Science, pp. 549\u2013561 (2009)","DOI":"10.1007\/978-3-642-02927-1_46"},{"key":"10282_CR8","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1016\/j.ic.2008.12.009","volume":"207","author":"M Hoyrup","year":"2009","unstructured":"Hoyrup, M., Rojas, C.: Computability of probability measures and Martin-L\u00f6f randomness over metric spaces. Inf. Comput. 207, 830\u2013847 (2009)","journal-title":"Inf. Comput."},{"key":"10282_CR9","doi-asserted-by":"publisher","DOI":"10.1002\/0471725250","volume-title":"Robust Statistics","author":"PJ Huber","year":"1981","unstructured":"Huber, P.J.: Robust Statistics. John Wiley & Sons, New York, NY (1981)"},{"key":"10282_CR10","first-page":"1","volume":"10","author":"A Kreuzer","year":"2014","unstructured":"Kreuzer, A.: Bounded variation and the strength of Helly\u2019s Selection Theorem. Logical Methods Comput. Sci. 10, 1\u201323 (2014)","journal-title":"Logical Methods Comput. Sci."},{"key":"10282_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1002\/malq.201200076","volume":"60","author":"A Kreuzer","year":"2014","unstructured":"Kreuzer, A.: From Bolzano-Weierstra\u00df to Arzel\u00e0-Ascoli. Math. Log. Q. 60, 177\u2013183 (2014)","journal-title":"Math. Log. Q."},{"key":"10282_CR12","doi-asserted-by":"crossref","unstructured":"Lo G.S., Ngom, M., Kpanzou, T.A.: Weak convergence (IA). Sequences of random vectors. arXiv:abs\/1610.05415 (2016)","DOI":"10.16929\/sbs\/2016.0001"},{"key":"10282_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2022.104997","volume":"290","author":"T McNicholl","year":"2023","unstructured":"McNicholl, T., Rojas, D.: Effective notions of weak convergence of measures on the real line. Inf. Comput. 290, 104997 (2023)","journal-title":"Inf. Comput."},{"key":"10282_CR14","unstructured":"Pauly, A.: Effective local compactness and the hyperspace of located sets. arXiv:abs\/1903.05490 (2019)"},{"key":"10282_CR15","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1137\/1101016","volume":"1","author":"Y Prokhorov","year":"1956","unstructured":"Prokhorov, Y.: Convergence of random processes and limit theorems in probability theory. Theory Prob. Its Appl. 1, 157\u2013214 (1956)","journal-title":"Theory Prob. Its Appl."},{"key":"10282_CR16","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s00153-023-00886-2","volume":"63","author":"D Rojas","year":"2024","unstructured":"Rojas, D.: Effective weak and vague convergence of measures on the real line. Arch. Math. Logic 63, 225\u2013238 (2024)","journal-title":"Arch. Math. Logic"},{"key":"10282_CR17","unstructured":"Rute, J.: On the close interaction between algorithmic randomness and constructive\/computable measure theory. arXiv:abs\/1812.03375 (2018)"},{"issue":"3","key":"10282_CR18","doi-asserted-by":"publisher","first-page":"145","DOI":"10.2307\/2267043","volume":"14","author":"E Specker","year":"1949","unstructured":"Specker, E.: Nicht konstruktiv beweisbare S\u00e4tze der Analysis. J. Symbol. Logic 14(3), 145\u2013158 (1949)","journal-title":"J. Symbol. Logic"},{"key":"10282_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis","author":"K Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis. Texts in Theoretical Computer Science. An EATCS Series. Springer-Verlag, Berlin (2000)"},{"key":"10282_CR20","doi-asserted-by":"crossref","unstructured":"Weihrauch, K.: Computable analysis: An introduction. Springer-Verlag, (2000)","DOI":"10.1007\/978-3-642-56999-9"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-026-10282-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-026-10282-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-026-10282-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T13:40:37Z","timestamp":1779975637000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-026-10282-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,28]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["10282"],"URL":"https:\/\/doi.org\/10.1007\/s00224-026-10282-x","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,28]]},"assertion":[{"value":"28 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 May 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"36"}}