|InterJournal Complex Systems, 48
|Manuscript Number: |
Submission Date: 963011
|Relative computational power of integrable and nonintegrable soliton systems|
Category: Brief Article
We will discuss the computational power of the ideal machines with which we model physical systems. Being able to simulate a Turing machine, or another universal model, is neither necessary nor sufficient for being able to perform useful computation. For example, certain particle machines can perform some very practical regular numerical computations, such as digital filtering, quite efficiently, and yet these PMs are not necessarily universal. Conversely, simulating a Turing machine is a very cumbersome and inefficient way to compute, and any practical application of physical phenomena to computing would require a more flexible computational environment. Nevertheless, universality serves as a guide to the inherent power of a particular machine model.
|Submit referee report/comment|