{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T07:13:53Z","timestamp":1777446833347,"version":"3.51.4"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030575052","type":"print"},{"value":"9783030575069","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-57506-9_13","type":"book-chapter","created":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T12:30:39Z","timestamp":1599741039000},"page":"163-179","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Measuring the Intelligence of an Idealized Mechanical Knowing Agent"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7930-110X","authenticated-orcid":false,"given":"Samuel Allen","family":"Alexander","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,10]]},"reference":[{"key":"13_CR1","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-319-47286-7_4","volume-title":"History and Philosophy of Computing","author":"A Aldini","year":"2016","unstructured":"Aldini, A., Fano, V., Graziani, P.: Theory of knowing machines: revisiting G\u00f6del and the mechanistic thesis. In: Gadducci, F., Tavosanis, M. (eds.) HaPoC 2015. IAICT, vol. 487, pp. 57\u201370. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-47286-7_4"},{"key":"13_CR2","unstructured":"Alexander, S.A.: The theory of several knowing machines. Doctoral dissertation, The Ohio State University (2013)"},{"issue":"3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/s11225-013-9491-6","volume":"102","author":"SA Alexander","year":"2014","unstructured":"Alexander, S.A.: A machine that knows its own code. Stud. Logica. 102(3), 567\u2013576 (2014). \n                    https:\/\/doi.org\/10.1007\/s11225-013-9491-6","journal-title":"Stud. Logica."},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s11225-013-9537-9","volume":"103","author":"SA Alexander","year":"2015","unstructured":"Alexander, S.A.: Fast-collapsing theories. Stud. Logica. 103(1), 53\u201373 (2015). \n                    https:\/\/doi.org\/10.1007\/s11225-013-9537-9","journal-title":"Stud. Logica."},{"issue":"9","key":"13_CR5","first-page":"71","volume":"12","author":"SA Alexander","year":"2018","unstructured":"Alexander, S.A.: Mathematical shortcomings in a simulated universe. Reasoner 12(9), 71\u201372 (2018)","journal-title":"Reasoner"},{"issue":"1\u20133","key":"13_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0168-0072(99)00048-2","volume":"105","author":"TJ Carlson","year":"2000","unstructured":"Carlson, T.J.: Knowledge, machines, and the consistency of Reinhardt\u2019s strong mechanistic thesis. Ann. Pure Appl. Log. 105(1\u20133), 51\u201382 (2000)","journal-title":"Ann. Pure Appl. Log."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Carlson, T.J.: Collapsing knowledge and epistemic Church\u2019s thesis. In: Horsten, L., Welch, P. (eds.) G\u00f6del\u2019s Disjunction: The Scope and Limits of Mathematical Knowledge, pp. 129\u2013148. Oxford University Press (2016)","DOI":"10.1093\/acprof:oso\/9780198759591.003.0006"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1038\/058630b0","volume":"58","author":"F Darwin","year":"1898","unstructured":"Darwin, F.: The knight-darwin law. Nature 58, 630\u2013632 (1898)","journal-title":"Nature"},{"key":"13_CR9","unstructured":"G\u00f6del, K.: Some basic theorems on the foundations of mathematics and their implications. In: Feferman, S., Dawson, J.W., Goldfarb, W., Parsons, C., Solovay, R.M. (eds.) Collected Works. Unpublished Essays and Lectures, vol. III, pp. 304\u2013323. Oxford University Press, New York and Oxford (1951)"},{"issue":"4","key":"13_CR10","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1093\/bjps\/19.4.357","volume":"19","author":"IJ Good","year":"1969","unstructured":"Good, I.J.: G\u00f6del\u2019s theorem is a red herring. Br. J. Philos. Sci. 19(4), 357\u2013358 (1969)","journal-title":"Br. J. Philos. Sci."},{"key":"13_CR11","first-page":"87","volume":"35","author":"GH Hardy","year":"1904","unstructured":"Hardy, G.H.: A theorem concerning the infinite cardinal numbers. Q. J. Math. 35, 87\u201394 (1904)","journal-title":"Q. J. Math."},{"issue":"18","key":"13_CR12","doi-asserted-by":"publisher","first-page":"1508","DOI":"10.1016\/j.artint.2010.09.006","volume":"174","author":"J Hern\u00e1ndez-Orallo","year":"2010","unstructured":"Hern\u00e1ndez-Orallo, J., Dowe, D.L.: Measuring universal intelligence: towards an anytime intelligence test. Artif. Intell. 174(18), 1508\u20131539 (2010)","journal-title":"Artif. Intell."},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-642-22887-2_34","volume-title":"Artificial General Intelligence","author":"B Hibbard","year":"2011","unstructured":"Hibbard, B.: Measuring agent intelligence via hierarchies of environments. In: Schmidhuber, J., Th\u00f3risson, K.R., Looks, M. (eds.) AGI 2011. LNCS (LNAI), vol. 6830, pp. 303\u2013308. Springer, Heidelberg (2011). \n                    https:\/\/doi.org\/10.1007\/978-3-642-22887-2_34"},{"issue":"4","key":"13_CR14","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s11023-007-9079-x","volume":"17","author":"S Legg","year":"2007","unstructured":"Legg, S., Hutter, M.: Universal intelligence: a definition of machine intelligence. Minds Mach. 17(4), 391\u2013444 (2007). \n                    https:\/\/doi.org\/10.1007\/s11023-007-9079-x","journal-title":"Minds Mach."},{"issue":"1\u20132","key":"13_CR15","first-page":"143","volume":"19","author":"M Hutter","year":"2012","unstructured":"Hutter, M.: Can intelligence explode? J. Conscious. Stud. 19(1\u20132), 143\u2013166 (2012)","journal-title":"J. Conscious. Stud."},{"issue":"4","key":"13_CR16","doi-asserted-by":"publisher","first-page":"150","DOI":"10.2307\/2267778","volume":"3","author":"SC Kleene","year":"1938","unstructured":"Kleene, S.C.: On notation for ordinal numbers. J. Symb. Log. 3(4), 150\u2013155 (1938)","journal-title":"J. Symb. Log."},{"key":"13_CR17","volume-title":"Proof Theory: An Introduction","author":"W Pohlers","year":"2009","unstructured":"Pohlers, W.: Proof Theory: An Introduction. Springer, Heidelberg (2009)"},{"issue":"3","key":"13_CR18","doi-asserted-by":"publisher","first-page":"317","DOI":"10.2307\/2214945","volume":"19","author":"W Reinhardt","year":"1985","unstructured":"Reinhardt, W.: Absolute versions of incompleteness theorems. No\u00fbs 19(3), 317\u2013346 (1985)","journal-title":"No\u00fbs"},{"issue":"3","key":"13_CR19","doi-asserted-by":"publisher","first-page":"273","DOI":"10.2307\/421032","volume":"4","author":"S Shapiro","year":"1998","unstructured":"Shapiro, S.: Incompleteness, mechanism, and optimism. Bull. Symb. Log. 4(3), 273\u2013302 (1998)","journal-title":"Bull. Symb. Log."},{"issue":"3","key":"13_CR20","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1080\/09528130601143109","volume":"19","author":"P Wang","year":"2007","unstructured":"Wang, P.: Three fundamental misconceptions of artificial intelligence. J. Exp. Theor. Artif. Intell. 19(3), 249\u2013268 (2007)","journal-title":"J. Exp. Theor. Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Software Engineering and Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-57506-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T16:19:55Z","timestamp":1599754795000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-57506-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030575052","9783030575069"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57506-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"10 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SEFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Software Engineering and Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oslo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","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":"16 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","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":"sefm2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sefm2019.inria.fr\/","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":"45","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":"13","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":"7","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":"29% - 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":"1","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)"}}]}}