{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/compiling-turing-machines-into-storage","title":"Compiling Turing Machines into Storage Modification Machines","arxiv_id":"2110.01415","date":"2021-09-28","proceeding":null,"authors":["J. -M. Chauvet"],"abstract":"It is well known that Sch\\\"onhage's Storage Modification Machines (SMM) can simulate Turing Machines (TM) since Sch\\\"onhage's original proof of the Turing completeness of the eponymous machines. We propose a simple transformation of TM into SMM, setting the base for a straightforward TM-to-SMM compiler.","url_abs":"https://arxiv.org/abs/2110.01415v1","url_pdf":"https://arxiv.org/pdf/2110.01415v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"compiling-turing-machines-into-storage","repo_url":"https://github.com/crtandkdu/smm","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}