{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T04:26:12Z","timestamp":1773030372223,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T00:00:00Z","timestamp":1708300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T00:00:00Z","timestamp":1708300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"UTSW High Risk\/High Impact grant"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput Sci"],"DOI":"10.1038\/s43588-024-00593-9","type":"journal-article","created":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T17:02:21Z","timestamp":1708362141000},"page":"110-118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Automated discovery of algorithms from data"],"prefix":"10.1038","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5962-6444","authenticated-orcid":false,"given":"Paul J.","family":"Blazek","sequence":"first","affiliation":[]},{"given":"Kesavan","family":"Venkatesh","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8680-2685","authenticated-orcid":false,"given":"Milo M.","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,19]]},"reference":[{"key":"593_CR1","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.inffus.2019.12.012","volume":"58","author":"AB Arrieta","year":"2020","unstructured":"Arrieta, A. B. et al. Explainable artificial intelligence (XAI): concepts, taxonomies, opportunities and challenges toward responsible AI. Inf. Fusion 58, 82\u2013115 (2020).","journal-title":"Inf. Fusion"},{"key":"593_CR2","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1609\/aimag.v40i2.2850","volume":"40","author":"D Gunning","year":"2019","unstructured":"Gunning, D. & Aha, D. DARPA\u2019s explainable artificial intelligence (XAI) program. AI Magazine 40, 44\u201358 (2019).","journal-title":"AI Magazine"},{"key":"593_CR3","unstructured":"Marcus, G. Deep learning: a critical appraisal. Preprint at http:\/\/arxiv.org\/abs\/1801.00631 (2018)."},{"key":"593_CR4","unstructured":"Chen, M. et al. Evaluating large language models trained on code. Preprint at http:\/\/arxiv.org\/abs\/2107.03374 (2021)."},{"key":"593_CR5","unstructured":"Austin, J. et al. Program synthesis with large language models. Preprint at http:\/\/arxiv.org\/abs\/2108.07732 (2021)."},{"key":"593_CR6","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1126\/science.abq1158","volume":"378","author":"Y Li","year":"2022","unstructured":"Li, Y. et al. Competition-level code generation with AlphaCode. Science 378, 1092\u20131097 (2022).","journal-title":"Science"},{"key":"593_CR7","unstructured":"Zelikman, E. et al. Parsel: algorithmic reasoning with language models by composing decompositions. Preprint at http:\/\/arxiv.org\/abs\/2212.10561 (2023)."},{"key":"593_CR8","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1038\/s41586-023-06924-6","volume":"625","author":"B Romera-Paredes","year":"2023","unstructured":"Romera-Paredes, B. et al. Mathematical discoveries from program search with large language models. Nature 625, 468-475 (2023).","journal-title":"Nature"},{"key":"593_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1038\/s41586-022-05172-4","volume":"610","author":"A Fawzi","year":"2022","unstructured":"Fawzi, A. et al. Discovering faster matrix multiplication algorithms with reinforcement learning. Nature 610, 47\u201353 (2022).","journal-title":"Nature"},{"key":"593_CR10","doi-asserted-by":"crossref","unstructured":"Gulwani, S. Automating string processing in spreadsheets using input\u2013output examples. In POPL \u201911: Proc. 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages Vol. 46, 317\u2013330 (ACM, 2011).","DOI":"10.1145\/1925844.1926423"},{"key":"593_CR11","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/2736282","volume":"58","author":"S Gulwani","year":"2015","unstructured":"Gulwani, S. et al. Inductive programming meets the real world. Commun. ACM 58, 90\u201399 (2015).","journal-title":"Commun. ACM"},{"key":"593_CR12","unstructured":"Raedt, L. D. et al. (eds) Approaches and Applications of Inductive Programming (Dagstuhl Seminar 19202) (Dagstuhl, 2019)."},{"key":"593_CR13","doi-asserted-by":"crossref","unstructured":"Kitzelmann, E. Inductive Programming: A Survey of Program Synthesis Techniques in Approaches and Applications of Inductive Programming (eds Schmid, U. et al.) 50\u201373 (Springer, 2010).","DOI":"10.1007\/978-3-642-11931-6_3"},{"key":"593_CR14","unstructured":"Balog, M., Gaunt, A. L., Brockschmidt, M., Nowozin, S. & Tarlow, D. DeepCoder: learning to write programs. In 5th Int. Conf. Learn. Represent. (2017)."},{"key":"593_CR15","doi-asserted-by":"crossref","unstructured":"Polozov, O. & Gulwani, S. FlashMeta: a framework for inductive program synthesis. In Proc. 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications 107\u2013126 (ACM, 2015).","DOI":"10.1145\/2814270.2814310"},{"key":"593_CR16","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1038\/s43588-021-00132-w","volume":"1","author":"PJ Blazek","year":"2021","unstructured":"Blazek, P. J. & Lin, M. M. Explainable neural networks that simulate reasoning. Nat. Comput. Sci. 1, 607\u2013618 (2021).","journal-title":"Nat. Comput. Sci."},{"key":"593_CR17","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1002\/aaai.12036","volume":"43","author":"HA Kautz","year":"2022","unstructured":"Kautz, H. A. The third AI summer: AAAI Robert S. Engelmore memorial lecture. AI Magazine 43, 105\u2013125 (2022).","journal-title":"AI Magazine"},{"key":"593_CR18","unstructured":"Besold, T. R. et al. in Neuro-symbolic artificial intelligence: the state of the art. (eds Hitzler, P. & Sarker, M. K.) Ch. 1 (IOS Press, 2022)."},{"key":"593_CR19","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF02478259","volume":"5","author":"W McCulloch","year":"1943","unstructured":"McCulloch, W. & Pitts, W. A logical calculus of the ideas immanent in nervous activity. Bull. Math. Biophys. 5, 115\u2013133 (1943).","journal-title":"Bull. Math. Biophys."},{"key":"593_CR20","doi-asserted-by":"publisher","unstructured":"Mitchell, M. in Non-standard Computation\u2014Molecular Computation, Cellular Automata, Evolutionary Algorithms, Quantum Computers (eds Gram\u00df, T. et al.) Ch. 4 (Wiley, 2005); https:\/\/doi.org\/10.1002\/3527602968.ch4","DOI":"10.1002\/3527602968.ch4"},{"key":"593_CR21","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1103\/RevModPhys.55.601","volume":"55","author":"S Wolfram","year":"1983","unstructured":"Wolfram, S. Statistical mechanics of cellular automata. Rev. Modern Phys. 55, 601\u2013644 (1983).","journal-title":"Rev. Modern Phys."},{"key":"593_CR22","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1038\/s41586-023-06668-3","volume":"623","author":"BM Lake","year":"2023","unstructured":"Lake, B. M. & Baroni, M. Human-like systematic generalization through a meta-learning neural network. Nature 623, 115\u2013121 (2023).","journal-title":"Nature"},{"key":"593_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0010-0277(88)90031-5","volume":"28","author":"JA Fodor","year":"1988","unstructured":"Fodor, J. A. & Pylyshyn, Z. W. Connectionism and cognitive architecture: a critical analysis. Cognition 28, 3\u201371 (1988).","journal-title":"Cognition"},{"key":"593_CR24","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1038\/scientificamerican1070-120","volume":"223","author":"M Gardner","year":"1970","unstructured":"Gardner, M. Mathematical games: the fantastic combinations of John Conway\u2019s new solitaire game life. Scientific American 223, 120\u2013123 (1970).","journal-title":"Scientific American"},{"key":"593_CR25","doi-asserted-by":"crossref","unstructured":"Rendell, P. A universal Turing machine in Conway\u2019s Game of Life. In 2011 International Conference on High Performance Computing Simulation 764\u2013772 (IEEE, 2011).","DOI":"10.1109\/HPCSim.2011.5999906"},{"key":"593_CR26","doi-asserted-by":"crossref","unstructured":"Karp, R. Reducibility among combinatorial problems. In Proc. Complexity of Computer Computations Vol. 40, 85\u2013103 (Springer, 1972).","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"593_CR27","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1137\/15M1053369","volume":"46","author":"M Poloczek","year":"2017","unstructured":"Poloczek, M., Schnitger, G., Williamson, D. & Zuylen, A. Greedy algorithms for the maximum satisfiability problem: simple algorithms and inapproximability bounds. SIAM J. Comput. 46, 1029\u20131061 (2017).","journal-title":"SIAM J. Comput."},{"key":"593_CR28","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1016\/j.patcog.2014.08.027","volume":"48","author":"P Mukhopadhyay","year":"2015","unstructured":"Mukhopadhyay, P. & Chaudhuri, B. B. A survey of Hough transform. Pattern Recognition 48, 993\u20131010 (2015).","journal-title":"Pattern Recognition"},{"key":"593_CR29","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1038\/s41586-021-03380-y","volume":"592","author":"GS Adams","year":"2021","unstructured":"Adams, G. S., Converse, B. A., Hales, A. H. & Klotz, L. E. People systematically overlook subtractive changes. Nature 592, 258\u2013261 (2021).","journal-title":"Nature"},{"key":"593_CR30","doi-asserted-by":"publisher","first-page":"1417","DOI":"10.1002\/j.1538-7305.1956.tb03835.x","volume":"35","author":"EJ McCluskey","year":"1956","unstructured":"McCluskey, E. J. Minimization of Boolean functions. Bell Syst. Tech. J. 35, 1417\u20131444 (1956).","journal-title":"Bell Syst. Tech. J."},{"key":"593_CR31","doi-asserted-by":"publisher","unstructured":"Blazek, P. B. & Lin, M. M. Deep distilling: automated algorithm discovery using explainable deep learning. Code Ocean https:\/\/doi.org\/10.24433\/CO.6047170.v1 (2024).","DOI":"10.24433\/CO.6047170.v1"}],"container-title":["Nature Computational Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s43588-024-00593-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s43588-024-00593-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s43588-024-00593-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T17:03:48Z","timestamp":1709053428000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s43588-024-00593-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,19]]},"references-count":31,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2024,2]]}},"alternative-id":["593"],"URL":"https:\/\/doi.org\/10.1038\/s43588-024-00593-9","relation":{},"ISSN":["2662-8457"],"issn-type":[{"value":"2662-8457","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,19]]},"assertion":[{"value":"4 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"P.J.B. and M.M.L. are co-authors on international patent applications related to ENNs (PCT\/US2021\/019470) and to deep distilling (PCT\/US2022\/040885). K.V. declares no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}