{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T09:04:49Z","timestamp":1750323889156,"version":"3.37.3"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"content-version":"vor","delay-in-days":2,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Universit\u00e4t der Bundeswehr M\u00fcnchen"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2024,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A real number is called <jats:italic>left-computable<\/jats:italic> if there exists a computable increasing sequence of rational numbers converging to it. In this article we are investigating a proper subset of the left-computable numbers. We say that a real number <jats:italic>x<\/jats:italic> is <jats:italic>reordered computable<\/jats:italic> if there exist a computable function <jats:inline-formula><jats:alternatives><jats:tex-math>$$f :\\mathbb {N} \\rightarrow \\mathbb {N}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>f<\/mml:mi>\n                    <mml:mo>:<\/mml:mo>\n                    <mml:mi>N<\/mml:mi>\n                    <mml:mo>\u2192<\/mml:mo>\n                    <mml:mi>N<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> with <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\sum _{k=0}^{\\infty } 2^{-f(k)} = x$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:msubsup>\n                      <mml:mo>\u2211<\/mml:mo>\n                      <mml:mrow>\n                        <mml:mi>k<\/mml:mi>\n                        <mml:mo>=<\/mml:mo>\n                        <mml:mn>0<\/mml:mn>\n                      <\/mml:mrow>\n                      <mml:mi>\u221e<\/mml:mi>\n                    <\/mml:msubsup>\n                    <mml:msup>\n                      <mml:mn>2<\/mml:mn>\n                      <mml:mrow>\n                        <mml:mo>-<\/mml:mo>\n                        <mml:mi>f<\/mml:mi>\n                        <mml:mo>(<\/mml:mo>\n                        <mml:mi>k<\/mml:mi>\n                        <mml:mo>)<\/mml:mo>\n                      <\/mml:mrow>\n                    <\/mml:msup>\n                    <mml:mo>=<\/mml:mo>\n                    <mml:mi>x<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and a bijective function <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\sigma :\\mathbb {N} \\rightarrow \\mathbb {N}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>\u03c3<\/mml:mi>\n                    <mml:mo>:<\/mml:mo>\n                    <mml:mi>N<\/mml:mi>\n                    <mml:mo>\u2192<\/mml:mo>\n                    <mml:mi>N<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> such that the rearranged series <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\sum _{k=0}^{\\infty } 2^{-f(\\sigma (k))}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:msubsup>\n                      <mml:mo>\u2211<\/mml:mo>\n                      <mml:mrow>\n                        <mml:mi>k<\/mml:mi>\n                        <mml:mo>=<\/mml:mo>\n                        <mml:mn>0<\/mml:mn>\n                      <\/mml:mrow>\n                      <mml:mi>\u221e<\/mml:mi>\n                    <\/mml:msubsup>\n                    <mml:msup>\n                      <mml:mn>2<\/mml:mn>\n                      <mml:mrow>\n                        <mml:mo>-<\/mml:mo>\n                        <mml:mi>f<\/mml:mi>\n                        <mml:mo>(<\/mml:mo>\n                        <mml:mi>\u03c3<\/mml:mi>\n                        <mml:mo>(<\/mml:mo>\n                        <mml:mi>k<\/mml:mi>\n                        <mml:mo>)<\/mml:mo>\n                        <mml:mo>)<\/mml:mo>\n                      <\/mml:mrow>\n                    <\/mml:msup>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> converges computably. In this article we will give some examples and counterexamples for reordered computable numbers and we will show that these numbers are closed under addition, multiplication and the Solovay reduction. Finally, we will also present a density theorem for reordered computable numbers.<\/jats:p>","DOI":"10.1007\/s00224-024-10183-x","type":"journal-article","created":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T14:56:15Z","timestamp":1733237775000},"page":"1683-1708","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Reordered Computable Numbers"],"prefix":"10.1007","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-9063-028X","authenticated-orcid":false,"given":"Philip","family":"Janicki","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,3]]},"reference":[{"key":"10183_CR1","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. Theoret. Comput. Sci. 255, 125\u2013149 (2001)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10183_CR2","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1137\/S0097539700376937","volume":"31","author":"RG Downey","year":"2002","unstructured":"Downey, R.G., Hirschfeldt, D.R., Nies, A.: Randomness, computability, and density. SIAM J. Comput. 31(4), 1169\u20131183 (2002)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10183_CR3","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/S0304-3975(01)00110-4","volume":"284","author":"RG Downey","year":"2002","unstructured":"Downey, R.G., LaForte, G.L.: Presentations of computably enumerable reals. Theoret. Comput. Sci. 284(2), 539\u2013555 (2002)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10183_CR4","first-page":"57","volume":"13","author":"P Hertling","year":"2023","unstructured":"Hertling, P., Janicki, P.: Nearly computable real numbers. Computability 13(1), 57\u201388 (2023)","journal-title":"Nearly computable real numbers. Computability"},{"key":"10183_CR5","unstructured":"Janicki, P. (2023) Reordered computable numbers. In: CCA 2023 Conference Abstracts, Inter-University Centre Dubrovnik, Dubrovnik, Croatia. Extended Abstract"},{"issue":"1","key":"10183_CR6","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1137\/S0097539799357441","volume":"31","author":"A Kucera","year":"2001","unstructured":"Kucera, A., Slaman, T.: Randomness and recursive enumerability. SIAM J. Comput. 31(1), 199\u2013211 (2001)","journal-title":"SIAM J. Comput."},{"key":"10183_CR7","doi-asserted-by":"publisher","first-page":"215","DOI":"10.2140\/pjm.1969.31.215","volume":"31","author":"R Soare","year":"1969","unstructured":"Soare, R.: Cohesive sets and recursively enumerable Dedekind cuts. Pacific J. Math. 31, 215\u2013231 (1969)","journal-title":"Pacific J. Math."},{"key":"10183_CR8","unstructured":"Solovay, R.M. (1975) Draft of a paper (or series of papers) on Chaitin\u2019s work. Unpublished notes"},{"key":"10183_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/11494645_57","volume-title":"New Computational Paradigms, First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8\u201312, 2005, Proceedings","author":"F Stephan","year":"2005","unstructured":"Stephan, F., Wu, G.: Presentations of K-trivial reals and Kolmogorov complexity. In: Cooper, S.B., L\u00f6we, B., Torenvliet, L. (eds.) New Computational Paradigms, First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8\u201312, 2005, Proceedings. Lecture Notes in Computer Science, vol. 3526, pp. 461\u2013469. Springer (2005)"},{"issue":"2","key":"10183_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1002\/malq.200310129","volume":"51","author":"G Wu","year":"2005","unstructured":"Wu, G.: Regular reals. Math. Log. Q. 51(2), 111\u2013119 (2005)","journal-title":"Math. Log. Q."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-024-10183-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-024-10183-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-024-10183-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,14]],"date-time":"2024-12-14T06:02:56Z","timestamp":1734156176000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-024-10183-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12]]},"references-count":10,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["10183"],"URL":"https:\/\/doi.org\/10.1007\/s00224-024-10183-x","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2024,12]]},"assertion":[{"value":"16 May 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}