{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T17:24:32Z","timestamp":1774977872234,"version":"3.50.1"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030800482","type":"print"},{"value":"9783030800499","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-80049-9_28","type":"book-chapter","created":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T18:06:14Z","timestamp":1625162774000},"page":"308-317","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On Subrecursive Representation of Irrational Numbers: Contractors and Baire Sequences"],"prefix":"10.1007","author":[{"given":"Lars","family":"Kristiansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,2]]},"reference":[{"key":"28_CR1","doi-asserted-by":"publisher","unstructured":"Georgiev, I., Kristiansen, L., Stephan, F.:Computable Irrational Numbers with Representations of Surprising Complexity. Ann.\u00a0Pure Appl.\u00a0Logic 172, 102893 (2021). https:\/\/doi.org\/10.1016\/j.apal.2020.102893","DOI":"10.1016\/j.apal.2020.102893"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.apal.2005.10.003","volume":"141","author":"P Gerhardy","year":"2006","unstructured":"Gerhardy, P., Kohlebach, U.: Strongly uniform bounds from semi-constructive proofs. Ann. Pure Appl. Logic 141, 89\u2013107 (2006). https:\/\/doi.org\/10.1016\/j.apal.2005.10.003","journal-title":"Ann. Pure Appl. Logic"},{"key":"28_CR3","first-page":"136","volume":"242","author":"U Kohlebach","year":"2003","unstructured":"Kohlebach, U., Olivia, P.: Proof mining: a systematic way of analysing proofs in mathematics. Proc. Steklov Inst. Math. 242, 136\u2013164 (2003)","journal-title":"Proc. Steklov Inst. Math."},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"249","DOI":"10.3233\/COM-160063","volume":"6","author":"L Kristiansen","year":"2017","unstructured":"Kristiansen, L.: On subrecursive representability of irrational numbers. Computability 6, 249\u2013276 (2017). https:\/\/doi.org\/10.3233\/COM-160063","journal-title":"Computability"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"43","DOI":"10.3233\/COM-170081","volume":"8","author":"L Kristiansen","year":"2019","unstructured":"Kristiansen, L.: On subrecursive representability of irrational numbers, part II. Computability 8, 43\u201365 (2019). https:\/\/doi.org\/10.3233\/COM-170081","journal-title":"Computability"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-030-51466-2_7","volume-title":"Beyond the Horizon of Computability","author":"L Kristiansen","year":"2020","unstructured":"Kristiansen, L., Simonsen, J.G.: on the complexity of conversion between classic real number representations. In: Anselmo, M., Della Vedova, G., Manea, F., Pauly, A. (eds.) CiE 2020. LNCS, vol. 12098, pp. 75\u201386. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51466-2_7"},{"issue":"2","key":"28_CR7","doi-asserted-by":"publisher","first-page":"105","DOI":"10.4064\/fm-49-2-105-118","volume":"49","author":"RS Lehman","year":"1961","unstructured":"Lehman, R.S.: On primitive recursive real numbers. Fundamenta Mathematica 49(2), 105\u2013118 (1961)","journal-title":"Fundamenta Mathematica"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1080\/0025570X.1981.11976921","volume":"54","author":"I Richards","year":"1981","unstructured":"Richards, I.: Continued fractions without tears. Math. Mag. 54, 163\u2013171 (1981)","journal-title":"Math. Mag."}],"container-title":["Lecture Notes in Computer Science","Connecting with Computability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-80049-9_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,6]],"date-time":"2021-12-06T17:06:59Z","timestamp":1638810419000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-80049-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030800482","9783030800499"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-80049-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"2 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cie2021.ugent.be\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"56% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}