{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:18:34Z","timestamp":1743077914032,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030937577"},{"type":"electronic","value":"9783030937584"}],"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-030-93758-4_26","type":"book-chapter","created":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T18:05:41Z","timestamp":1641492341000},"page":"250-260","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Thousand Brains and\u00a0a\u00a0Million Theories"],"prefix":"10.1007","author":[{"given":"Grace","family":"Solomonoff","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,6]]},"reference":[{"key":"26_CR1","unstructured":"Glickstein, M.: Five minutes with Mitchell Glickstein (February 2014)"},{"key":"26_CR2","first-page":"23","volume":"10","author":"J Hawkins","year":"2016","unstructured":"Hawkins, J., Ahmad, S.: Why neurons have thousands of synapses. Front. Neural Circ. 10, 23 (2016)","journal-title":"Front. Neural Circ."},{"key":"26_CR3","unstructured":"Hawkins, J.: A Thousand Brains. Basic Books, Hachette Book Group, New York (2021)"},{"key":"26_CR4","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/978-3-030-11298-1_8","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"M Li","year":"2019","unstructured":"Li, M., Vit\u00e1nyi, P.: Physics, information, and computation. In: An Introduction to Kolmogorov Complexity and Its Applications. TCS, pp. 623\u2013761. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11298-1_8"},{"key":"26_CR5","volume-title":"The Theory that Would not Die","author":"SB McGrayne","year":"2011","unstructured":"McGrayne, S.B.: The Theory that Would not Die. Yale University Press, New Haven (2011)"},{"key":"26_CR6","unstructured":"Minsky, M.: Framework. Technical report, Dartmouth Summer Workshop (1956)"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Minsky, M.: The Society of Mind. Simon and Schuster (1987)","DOI":"10.21236\/ADA200313"},{"key":"26_CR8","unstructured":"Minsky, M., Rochester, N., McCarthy, J., Shannon, C.: A proposal for the Dartmouth summer research project on artificial intelligence (dart564props.pdf). Box A (August 1955)"},{"key":"26_CR9","unstructured":"Selfridge, O.: Pandemonium: A Paradigm for Learning (1959)"},{"key":"26_CR10","unstructured":"Solomonoff, R.J.: Notes on others. (Aug 1956). http:\/\/raysolomonoff.com\/dartmouth\/boxa\/"},{"key":"26_CR11","unstructured":"Solomonoff, R.J.: Ray AI approach (pdf). (Jan 1956). http:\/\/raysolomonoff.com\/dartmouth\/boxa"},{"key":"26_CR12","unstructured":"Solomonoff, R.J.: Does algorithmic probability solve the problem of induction? (1996)"},{"issue":"1","key":"26_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jcss.1997.1500","volume":"55","author":"RJ Solomonoff","year":"1997","unstructured":"Solomonoff, R.J.: The discovery of algorithmic probability. J. Comput. Syst. Sci. 55(1), 73\u201388 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"26_CR14","unstructured":"Solomonoff, R.J.: Letter to David Malkoff (to be published on raysolomonoff.com, July 1999)"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Solomonoff, R.J.: Algorithmic probability - its discovery - its properties and application to strong AI. In: Zenil, H. (ed.) Randomness Through Computation: Some Answers, More Questions. World Scientific (2011)","DOI":"10.1142\/9789814327756_0011"}],"container-title":["Lecture Notes in Computer Science","Artificial General Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93758-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,29]],"date-time":"2022-04-29T13:26:12Z","timestamp":1651238772000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93758-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030937577","9783030937584"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93758-4_26","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":"6 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AGI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial General Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"San Francisco, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"agi2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/agi-conf.org\/2021\/","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":"36","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":"72% - 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":"2.6","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":"3.8","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}