{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:19:58Z","timestamp":1742959198340,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031124280"},{"type":"electronic","value":"9783031124297"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-12429-7_9","type":"book-chapter","created":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T03:40:43Z","timestamp":1663990843000},"page":"117-133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Can Reinforcement Learning Learn Itself? A Reply to \u2018Reward is Enough\u2019"],"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":[[2022,9,25]]},"reference":[{"key":"9_CR1","unstructured":"Aldini, A., Fano, V., Graziani, P.: Do the self-knowing machines dream of knowing their factivity? In: AIC, pp. 125\u2013132 (2015)"},{"key":"9_CR2","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). https:\/\/doi.org\/10.1007\/978-3-319-47286-7_4"},{"issue":"3","key":"9_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. Log. 102(3), 567\u2013576 (2014)","journal-title":"Stud. Log."},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-52152-3_1","volume-title":"Artificial General Intelligence","author":"SA Alexander","year":"2020","unstructured":"Alexander, S.A.: AGI and the Knight-darwin law: why idealized AGI reproduction requires collaboration. In: Goertzel, B., Panov, A.I., Potapov, A., Yampolskiy, R. (eds.) AGI 2020. LNCS (LNAI), vol. 12177, pp. 1\u201311. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-52152-3_1"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-030-67220-1_16","volume-title":"Software Engineering and Formal Methods. SEFM 2020 Collocated Workshops","author":"SA Alexander","year":"2021","unstructured":"Alexander, S.A.: Short-circuiting the definition of mathematical knowledge for an artificial general intelligence. In: Cleophas, L., Massink, M. (eds.) SEFM 2020. LNCS, vol. 12524, pp. 201\u2013213. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-67220-1_16"},{"key":"9_CR6","unstructured":"Aristotle: on the soul. In: Barnes, J., et al. (eds.) The Complete Works of Aristotle. Princeton University Press (1984)"},{"key":"9_CR7","unstructured":"Brockman, G., et al.: OpenAI gym. Preprint (2016)"},{"issue":"3","key":"9_CR8","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1080\/00029890.1973.11993265","volume":"80","author":"M Davis","year":"1973","unstructured":"Davis, M.: Hilbert\u2019s tenth problem is unsolvable. Am. Math. Mon. 80(3), 233\u2013269 (1973)","journal-title":"Am. Math. Mon."},{"issue":"18","key":"9_CR9","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":"9_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-642-22887-2_9","volume-title":"Artificial General Intelligence","author":"J Hern\u00e1ndez-Orallo","year":"2011","unstructured":"Hern\u00e1ndez-Orallo, J., Dowe, D.L., Espa\u00f1a-Cubillo, S., Hern\u00e1ndez-Lloreda, M.V., Insa-Cabrera, J.: On more realistic environment distributions for defining, evaluating and developing intelligence. In: Schmidhuber, J., Th\u00f3risson, K.R., Looks, M. (eds.) AGI 2011. LNCS (LNAI), vol. 6830, pp. 82\u201391. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22887-2_9"},{"key":"9_CR11","volume-title":"Universal Artificial Intelligence: Sequential Decisions Based on Algorithmic Probability","author":"M Hutter","year":"2004","unstructured":"Hutter, M.: Universal Artificial Intelligence: Sequential Decisions Based on Algorithmic Probability. Springer, Heidelberg (2004)"},{"key":"9_CR12","unstructured":"Kaliszyk, C., Urban, J., Michalewski, H., Ol\u0161\u00e1k, M.: Reinforcement learning of theorem proving. In: NeurIPS (2018)"},{"issue":"4","key":"9_CR13","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. Mind. Mach. 17(4), 391\u2013444 (2007)","journal-title":"Mind. Mach."},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-642-44958-1_18","volume-title":"Algorithmic Probability and Friends. Bayesian Prediction and Artificial Intelligence","author":"S Legg","year":"2013","unstructured":"Legg, S., Veness, J.: An approximation of the universal intelligence measure. In: Dowe, D.L. (ed.) Algorithmic Probability and Friends. Bayesian Prediction and Artificial Intelligence. LNCS, vol. 7070, pp. 236\u2013249. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-44958-1_18"},{"issue":"1","key":"9_CR15","first-page":"103","volume":"20","author":"P Maguire","year":"2020","unstructured":"Maguire, P., Moser, P., Maguire, R.: Are people smarter than machines? Croatian J. Philos. 20(1), 103\u2013123 (2020)","journal-title":"Croatian J. Philos."},{"issue":"7540","key":"9_CR16","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1038\/nature14236","volume":"518","author":"V Mnih","year":"2015","unstructured":"Mnih, V., et al.: Human-level control through deep reinforcement learning. Nature 518(7540), 529\u2013533 (2015)","journal-title":"Nature"},{"issue":"10","key":"9_CR17","doi-asserted-by":"publisher","first-page":"2108","DOI":"10.1016\/j.jid.2018.06.175","volume":"138","author":"A Narla","year":"2018","unstructured":"Narla, A., Kuprel, B., Sarin, K., Novoa, R., Ko, J.: Automated classification of skin lesions: from pixels to practice. J. Investig. Dermatol. 138(10), 2108\u20132110 (2018)","journal-title":"J. Investig. Dermatol."},{"key":"9_CR18","unstructured":"Raffin, A., Hill, A., Ernestus, M., Gleave, A., Kanervisto, A., Dormann, N.: Stable baselines3 (2019). https:\/\/github.com\/DLR-RM\/stable-baselines3"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1613\/jair.133","volume":"2","author":"SJ Russell","year":"1994","unstructured":"Russell, S.J., Subramanian, D.: Provably bounded-optimal agents. J. Artif. Intell. Res. 2, 575\u2013609 (1994)","journal-title":"J. Artif. Intell. Res."},{"key":"9_CR20","unstructured":"Schulman, J., Wolski, F., Dhariwal, P., Radford, A., Klimov, O.: Proximal policy optimization algorithms. Preprint (2017)"},{"issue":"7587","key":"9_CR21","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1038\/nature16961","volume":"529","author":"D Silver","year":"2016","unstructured":"Silver, D., et al.: Mastering the game of Go with deep neural networks and tree search. Nature 529(7587), 484\u2013489 (2016)","journal-title":"Nature"},{"issue":"7676","key":"9_CR22","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1038\/nature24270","volume":"550","author":"D Silver","year":"2017","unstructured":"Silver, D., et al.: Mastering the game of Go without human knowledge. Nature 550(7676), 354\u2013359 (2017)","journal-title":"Nature"},{"key":"9_CR23","doi-asserted-by":"publisher","first-page":"103535","DOI":"10.1016\/j.artint.2021.103535","volume":"299","author":"D Silver","year":"2021","unstructured":"Silver, D., Singh, S., Precup, D., Sutton, R.: Reward is enough. Artif. Intell. 299, 103535 (2021)","journal-title":"Artif. Intell."},{"issue":"2","key":"9_CR24","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1109\/TAMD.2010.2051031","volume":"2","author":"S Singh","year":"2010","unstructured":"Singh, S., Lewis, R.L., Barto, A.G., Sorg, J.: Intrinsically motivated reinforcement learning: an evolutionary perspective. IEEE Trans. Auton. Ment. Dev. 2(2), 70\u201382 (2010)","journal-title":"IEEE Trans. Auton. Ment. Dev."},{"key":"9_CR25","unstructured":"Watkins, C.: Learning from delayed rewards. Ph.D. thesis, Cambridge (1989)"},{"key":"9_CR26","unstructured":"Yampolskiy, R.: On controllability of artificial intelligence. Technical report (2020)"}],"container-title":["Lecture Notes in Computer Science","Software Engineering and Formal Methods. SEFM 2021 Collocated Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-12429-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T03:42:08Z","timestamp":1663990928000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-12429-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031124280","9783031124297"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-12429-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 September 2022","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sefm2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sefm-conference.github.io\/","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":"86","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":"22","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":"4","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":"26% - 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.5","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)"}}]}}