{"title":"The Computational Power of Frictional Mechanical Systems","authors":"John Z. Sun","doi":"10.1201/9781439863886-24","DOIUrl":null,"url":null,"abstract":"In this paper we deene a class of mechanical systems consisting of rigid objects (deened by linear or quadratic surface patches) connected by frictional contact linkages between surfaces. (This class of mechanisms is similar to the Analytical Engine developed by Babbage in 1800s except that we assume frictional surfaces instead of toothed gears.) We prove that a universal Turing Machine (TM) can be simulated by a (universal) frictional mechanical system in this class. Our universal frictional mechanical system has the property that it can reach a distinguished nal conngura-tion through a sequence of legal movements if and only if the universal TM accepts the input string encoded by its initial connguration. There are two implications from this result. First, the mover's problem is undecid-able when there are frictional linkages. Second, a mechanical computer can be constructed that has the computational power of any conventional electronic computer and yet has only a constant number of mechanical parts. Previous constructions for mechanical computing devices (such as Babbage's Analytical Engine) either provided no general construction for nite state control or the control was provided by electronic devices (as was common in electro-mechanical computers such as Mark I subsequent to Turing's result). Our result seems to be the rst to provide a general proof of the simulation of a universal TM via a purely mechanical mechanism. In addition, we discuss the universal frictional mechanical system in the context of an error model that allows error up to in each mechanical operation. First, we show that for a universal TM M, a frictional mechanical system of this-error model can be constructed such that, given any space bound S, the system can simulate the computation of M on any input string ! if M decides ! in space bound S, provided that < 2 ?cS for some constant c. Second, we show that, for any universal TM M and space bound S, if we let = O(S ?1), there exists a frictional mechanical system in the-error model that can simulate M on any input which M decides in space bound S.","PeriodicalId":49532,"journal":{"name":"SIAM Journal on Computing","volume":"1 1","pages":""},"PeriodicalIF":1.6000,"publicationDate":"1998-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Journal on Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1201/9781439863886-24","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 3
Abstract
In this paper we deene a class of mechanical systems consisting of rigid objects (deened by linear or quadratic surface patches) connected by frictional contact linkages between surfaces. (This class of mechanisms is similar to the Analytical Engine developed by Babbage in 1800s except that we assume frictional surfaces instead of toothed gears.) We prove that a universal Turing Machine (TM) can be simulated by a (universal) frictional mechanical system in this class. Our universal frictional mechanical system has the property that it can reach a distinguished nal conngura-tion through a sequence of legal movements if and only if the universal TM accepts the input string encoded by its initial connguration. There are two implications from this result. First, the mover's problem is undecid-able when there are frictional linkages. Second, a mechanical computer can be constructed that has the computational power of any conventional electronic computer and yet has only a constant number of mechanical parts. Previous constructions for mechanical computing devices (such as Babbage's Analytical Engine) either provided no general construction for nite state control or the control was provided by electronic devices (as was common in electro-mechanical computers such as Mark I subsequent to Turing's result). Our result seems to be the rst to provide a general proof of the simulation of a universal TM via a purely mechanical mechanism. In addition, we discuss the universal frictional mechanical system in the context of an error model that allows error up to in each mechanical operation. First, we show that for a universal TM M, a frictional mechanical system of this-error model can be constructed such that, given any space bound S, the system can simulate the computation of M on any input string ! if M decides ! in space bound S, provided that < 2 ?cS for some constant c. Second, we show that, for any universal TM M and space bound S, if we let = O(S ?1), there exists a frictional mechanical system in the-error model that can simulate M on any input which M decides in space bound S.
期刊介绍:
The SIAM Journal on Computing aims to provide coverage of the most significant work going on in the mathematical and formal aspects of computer science and nonnumerical computing. Submissions must be clearly written and make a significant technical contribution. Topics include but are not limited to analysis and design of algorithms, algorithmic game theory, data structures, computational complexity, computational algebra, computational aspects of combinatorics and graph theory, computational biology, computational geometry, computational robotics, the mathematical aspects of programming languages, artificial intelligence, computational learning, databases, information retrieval, cryptography, networks, distributed computing, parallel algorithms, and computer architecture.