{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:32:51Z","timestamp":1743013971625,"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_19","type":"book-chapter","created":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T23:03:35Z","timestamp":1562195015000},"page":"217-229","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["More Intensional Versions of Rice\u2019s Theorem"],"prefix":"10.1007","author":[{"given":"Jean-Yves","family":"Moyen","sequence":"first","affiliation":[]},{"given":"Jakob Grue","family":"Simonsen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,19]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Asperti, A.: The intensional content of Rice\u2019s theorem. In: POPL 2008 (2008)","DOI":"10.1145\/1328438.1328455"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01201998","volume":"2","author":"S Bellantoni","year":"1992","unstructured":"Bellantoni, S., Cook, S.: A new recursion-theoretic characterization of the poly-time functions. Comput. Complex. 2, 97\u2013110 (1992)","journal-title":"Comput. Complex."},{"issue":"2","key":"19_CR3","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"M Blum","year":"1967","unstructured":"Blum, M.: A machine-independent theory of the complexity of recursive functions. J. ACM 14(2), 322\u2013336 (1967)","journal-title":"J. ACM"},{"key":"19_CR4","unstructured":"Hoyrup, M.: The decidable properties of subrecursive functions. In: ICALP 2016, pp. 108:1\u2013108:13 (2016)"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-319-94418-0_22","volume-title":"Sailing Routes in the World of Computation","author":"M Hoyrup","year":"2018","unstructured":"Hoyrup, M.: Topological analysis of representations. In: Manea, F., Miller, R.G., Nowotka, D. (eds.) CiE 2018. LNCS, vol. 10936, pp. 214\u2013223. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94418-0_22"},{"issue":"4","key":"19_CR6","doi-asserted-by":"publisher","first-page":"1214","DOI":"10.1007\/s00224-016-9726-9","volume":"61","author":"M Hoyrup","year":"2017","unstructured":"Hoyrup, M., Rojas, C.: On the information carried by programs about the objects they compute. Theory Comput. Syst. 61(4), 1214\u20131236 (2017)","journal-title":"Theory Comput. Syst."},{"key":"19_CR7","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/2003.001.0001","volume-title":"Computability and Complexity, from a Programming Perspective","author":"ND Jones","year":"1997","unstructured":"Jones, N.D.: Computability and Complexity, from a Programming Perspective. MIT Press, Cambridge (1997)"},{"key":"19_CR8","unstructured":"Kahrs, S.: The primitive recursive functions are recursively enumerable. Technical report, University of Kent at Canterbury"},{"issue":"4","key":"19_CR9","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1112\/blms\/14.4.285","volume":"14","author":"L Kirby","year":"1982","unstructured":"Kirby, L., Paris, J.: Accessible independence results for peano arithmetic. Bull. Lond. Math. Soc. 14(4), 285\u2013293 (1982)","journal-title":"Bull. Lond. Math. Soc."},{"key":"19_CR10","first-page":"399","volume":"245","author":"G Kreisel","year":"1957","unstructured":"Kreisel, G., Lacombe, D., Shoenfield, J.: Fonctionelles recursivement d\u00e9finissables et fonctionnelles r\u00e9cursives. Comptes Rendus Hebdomadaires des S\u00e9ances de l\u2019Acad\u00e9mie des Sciences 245, 399\u2013402 (1957)","journal-title":"Comptes Rendus Hebdomadaires des S\u00e9ances de l\u2019Acad\u00e9mie des Sciences"},{"issue":"3","key":"19_CR11","doi-asserted-by":"publisher","first-page":"215","DOI":"10.4064\/fm-55-3-215-238","volume":"55","author":"Y Moschovakis","year":"1964","unstructured":"Moschovakis, Y.: Recursive metric spaces. Fundamenta Mathematicae 55(3), 215\u2013238 (1964)","journal-title":"Fundamenta Mathematicae"},{"key":"19_CR12","unstructured":"Moyen, J.Y., Simonsen, J.G.: More intensional versions of Rice\u2019s Theorem. In: Mazza, D. (ed.) Developments in Implicit Computational Complexity, DICE 2016, Eindhoven, Netherlands, p. 2 (2016)"},{"key":"19_CR13","unstructured":"Moyen, J., Simonsen, J.G.: Computability in the lattice of equivalence relations. In: Proceedings 8th Workshop on Developments in Implicit Computational Complexity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis (DICE-FOPARA@ETAPS 2017), pp. 38\u201346 (2017)"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1002\/malq.19550010407","volume":"1","author":"JR Myhill","year":"1955","unstructured":"Myhill, J.R., Shepherdson, J.C.: Effective operations on partial recursive functions. Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik 1, 310\u2013317 (1955)","journal-title":"Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik"},{"issue":"3","key":"19_CR15","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1215\/S0012-7094-42-00942-6","volume":"9","author":"\u00d8 Ore","year":"1942","unstructured":"Ore, \u00d8.: Theory of equivalence relations. Duke Math. J. 9(3), 573\u2013627 (1942)","journal-title":"Duke Math. J."},{"key":"19_CR16","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Boston (1994)"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1090\/S0002-9947-1953-0053041-6","volume":"74","author":"HG Rice","year":"1953","unstructured":"Rice, H.G.: Classes of recursively enumerable sets and their decision problems. Trans. Am. Math. Soc. 74, 358\u2013366 (1953)","journal-title":"Trans. Am. Math. Soc."},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1090\/S0002-9947-1956-0085187-3","volume":"82","author":"N Shapiro","year":"1956","unstructured":"Shapiro, N.: Degrees of computability. Trans. AMS 82, 281\u2013299 (1956)","journal-title":"Trans. AMS"},{"issue":"7\u201311","key":"19_CR19","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1002\/malq.19580040705","volume":"4","author":"RM Smullyan","year":"1958","unstructured":"Smullyan, R.M.: Undecidability and recursive inseparability. Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik 4(7\u201311), 143\u2013147 (1958)","journal-title":"Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik"},{"key":"19_CR20","first-page":"49","volume":"128","author":"G Tseitin","year":"1959","unstructured":"Tseitin, G.: Algorithmic operators in construtive complete separable metric spaces. Dokl. Akad. Nauk 128, 49\u201352 (1959). (in Russian)","journal-title":"Dokl. Akad. Nauk"},{"key":"19_CR21","first-page":"295","volume":"67","author":"G Tseitin","year":"1962","unstructured":"Tseitin, G.: Algorithmic operators in constructive metric spaces. Tr. Mat. Inst. Steklov 67, 295\u2013361 (1962). (in Russian. English translation. In: AMS Trans. 64 (1967))","journal-title":"Tr. Mat. Inst. Steklov"}],"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_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:20:46Z","timestamp":1709810446000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-22996-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030229955","9783030229962"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22996-2_19","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)"}}]}}