{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T09:04:01Z","timestamp":1750323841534,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030229955"},{"type":"electronic","value":"9783030229962"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-22996-2_27","type":"book-chapter","created":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T23:02:56Z","timestamp":1562194976000},"page":"310-322","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Differences and Sums of Strongly Computably Enumerable Real Numbers"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Ambos-Spies","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xizhong","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,19]]},"reference":[{"issue":"1","key":"27_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/s00224-012-9424-1","volume":"52","author":"K Ambos-Spies","year":"2013","unstructured":"Ambos-Spies, K., Ding, D., Fan, Y., Merkle, W.: Maximal pairs of computably enumerable sets in the computably Lipschitz degrees. Theory Comput. Syst. 52(1), 2\u201327 (2013)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"27_CR2","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1006\/jcom.2000.0561","volume":"16","author":"K Ambos-Spies","year":"2000","unstructured":"Ambos-Spies, K., Weihrauch, K., Zheng, X.: Weakly computable real numbers. J. Complex. 16(4), 676\u2013690 (2000)","journal-title":"J. Complex."},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/11494645_2","volume-title":"New Computational Paradigms","author":"G Barmpalias","year":"2005","unstructured":"Barmpalias, G.: Computably enumerable sets in the solovay and the strong weak truth table degrees. In: Cooper, S.B., L\u00f6we, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol. 3526, pp. 8\u201317. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11494645_2"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/978-3-319-50062-1_37","volume-title":"Computability and Complexity","author":"G Barmpalias","year":"2017","unstructured":"Barmpalias, G., Lewis-Pye, A.: A note on the differences of computably enumerable reals. In: Day, A., Fellows, M., Greenberg, N., Khoussainov, B., Melnikov, A., Rosamond, F. (eds.) Computability and Complexity. LNCS, vol. 10010, pp. 623\u2013632. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-50062-1_37"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.jcss.2017.06.002","volume":"89","author":"G Barmpalias","year":"2017","unstructured":"Barmpalias, G., Lewis-Pye, A.: Differences of halting probabilities. J. Comput. Syst. Sci. 89, 349\u2013360 (2017)","journal-title":"J. Comput. Syst. Sci."},{"key":"27_CR6","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 $$\\varOmega $$ numbers. Theor. Comput. Sci. 255, 125\u2013149 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"suppl. 1","key":"27_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1002\/1521-3870(200210)48:1+<29::AID-MALQ29>3.0.CO;2-O","volume":"48","author":"R Downey","year":"2002","unstructured":"Downey, R., Terwijn, S.A.: Computably enumerable reals and uniformly presentable ideals. MLQ Math. Log. Q. 48(suppl. 1), 29\u201340 (2002)","journal-title":"MLQ Math. Log. Q."},{"key":"27_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68441-3","volume-title":"Algorithmic Randomness and Complexity Theory and Application of Computability","author":"RG Downey","year":"2010","unstructured":"Downey, R.G., Hirschfeldt, D.R.: Algorithmic Randomness and Complexity Theory and Application of Computability. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-0-387-68441-3"},{"issue":"1","key":"27_CR9","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.jcss.2003.07.004","volume":"68","author":"RG Downey","year":"2004","unstructured":"Downey, R.G., Hirschfeldt, D.R., LaForte, L.G.: Randomness and reducibility. J. Comput. Syst. Sci. 68(1), 96\u2013114 (2004)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"27_CR10","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. Theor. Comput. Sci. 284(2), 539\u2013555 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1007\/978-3-319-50062-1_39","volume-title":"Computability and Complexity","author":"JS Miller","year":"2017","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"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Robinson, R.M.: Review of Peter, R. Rekursive Funktionen. J. Symbol. Log. 16, 280\u2013282 (1951)","DOI":"10.2307\/2267933"},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/11780342_48","volume-title":"Logical Approaches to Computational Barriers","author":"M Schr\u00f6der","year":"2006","unstructured":"Schr\u00f6der, M.: Admissible representations in computable analysis. In: Beckmann, A., Berger, U., L\u00f6we, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol. 3988, pp. 471\u2013480. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11780342_48"},{"key":"27_CR14","volume-title":"Degrees of Unsolvability","author":"GE Sacks","year":"1963","unstructured":"Sacks, G.E.: Degrees of Unsolvability. Princeton University Press, Princeton (1963)"},{"key":"27_CR15","first-page":"271","volume":"140","author":"Robert Irving Soare","year":"1969","unstructured":"Robert Irving Soare: Recursion theory and Dedekind cuts. Trans. Am. Math. Soc. 140, 271\u2013294 (1969)","journal-title":"Trans. Am. Math. Soc."},{"issue":"2","key":"27_CR16","first-page":"230","volume":"42","author":"AM Turing","year":"1936","unstructured":"Turing, A.M.: On computable numbers, with an application to the \u201cEntscheidungsproblem\u201d. Proc. Lond. Math. Soc. 42(2), 230\u2013265 (1936)","journal-title":"Proc. Lond. Math. Soc."},{"key":"27_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56999-9_1","volume-title":"Computable Analysis","author":"K Weihrauch","year":"2000","unstructured":"Weihrauch, K.: An introduction. In: Weihrauch, K. (ed.) Computable Analysis. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-642-56999-9_1"},{"issue":"2","key":"27_CR18","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1002\/malq.200310129","volume":"51","author":"W Guohua","year":"2005","unstructured":"Guohua, W.: Regular reals. Math. Log. Q. 51(2), 111\u2013119 (2005)","journal-title":"Math. Log. Q."},{"issue":"2","key":"27_CR19","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1093\/logcom\/13.2.159","volume":"13","author":"X Zheng","year":"2003","unstructured":"Zheng, X.: On the turing degrees of weakly computable real numbers. J. Log. Comput. 13(2), 159\u2013172 (2003)","journal-title":"J. Log. Comput."},{"issue":"4\/5","key":"27_CR20","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1002\/malq.200310110","volume":"50","author":"X Zheng","year":"2004","unstructured":"Zheng, X., Rettinger, R.: Weak computability and representation of reals. Math. Log. Q. 50(4\/5), 431\u2013442 (2004)","journal-title":"Math. Log. Q."},{"key":"27_CR21","unstructured":"Zheng, X., Rettinger, R.: Computability of real numbers. In: Brattka, V., Hertling, P. (eds.) Handbook on Computability and Complexity in Analysis, Theory and Applications of Computability. Springer-Verlag (to appear)"}],"container-title":["Lecture Notes in Computer Science","Computing with Foresight and Industry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-22996-2_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:21:27Z","timestamp":1709810487000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-22996-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030229955","9783030229962"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22996-2_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"19 June 2019","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":"Durham","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/community.dur.ac.uk\/cie.2019\/","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":"35","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":"20","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":"57% - 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":"4","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)"}},{"value":"Also included are 7 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}