Constructor algorithms for building unconventional computers able to solve NP-complete problems
Abstract: Nature often builds physical structures tailored for specific information processing tasks with computations encoded using diverse phenomena. These can sometimes outperform typical general-purpose computers. However, describing the construction and function of these unconventional computers is often challenging. Here, we address this by introducing constructor algorithms in the context of a robotic wire machine that can be programmed to build networks of connected wires in response to a problem and then act upon these to efficiently carry out a desired computation. We show how this approach can be used to solve the NP-complete Subset Sum Problem (SSP) and provide information about the number of solutions through changes in the voltages and currents measured across these networks. This work provides a foundation for building unconventional computers that encode information purely in the lengths and connections of electrically conductive wires. It also demonstrates the power of computing paradigms beyond digital logic and opens avenues to more fully harness the inherent computational capabilities of diverse physical, chemical and biological substrates.
- Hameed, R. et al. Understanding sources of inefficiency in general-purpose chips. In Proceedings of the 37th Annual International Symposium on Computer Architecture, ISCA ’10, 37–47 (Association for Computing Machinery, 2010).
- Molecular information processing: lessons from bacterial chemotaxis. Journal of Biological Chemistry 277, 9625–9628 (2002).
- Biological efficiency in processing information in green plants. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 479, 20220809 (2023).
- Berridge, M. J. The Versatility and Complexity of Calcium Signalling, 52–67 (John Wiley & Sons, Ltd, 2001).
- Adamatzky, A. Towards fungal computer. Interface Focus 8, 20180029 (2018).
- Liquid brains, solid brains. Philosophical Transactions of the Royal Society B: Biological Sciences 374, 20190040 (2019).
- Thomson, W. Iv. on an instrument for calculating (∫θ(x)ϕ(x)𝑑x𝜃𝑥italic-ϕ𝑥differential-d𝑥\int\theta(x)\phi(x)dx∫ italic_θ ( italic_x ) italic_ϕ ( italic_x ) italic_d italic_x), the integral of the product of two given functions. Proceedings of the Royal Society of London 24, 266–268 (1876).
- Neural network computation with dna strand displacement cascades. Nature 475, 368–372 (2011).
- Living computers powered by biochemistry. The Biochemist 41, 14–18 (2019).
- Grozinger, L. et al. Pathways to cellular supremacy in biocomputing. Nature Communications 10, 5250 (2019).
- Toffoli, T. Programmable matter methods. Future Generation Computer Systems 16, 187–201 (1999).
- Mead, C. Neuromorphic electronic systems. Proceedings of the IEEE 78, 1629–1636 (1990).
- Analog coupled oscillator based weighted ising machine. Scientific reports 9, 14786 (2019).
- Regot, S. et al. Distributed biological computation with multicellular engineered networks. Nature 469, 207–211 (2011).
- Benenson, Y. Biomolecular computing systems: principles, progress and potential. Nature Reviews Genetics 13, 455–468 (2012).
- Computational Matter (Springer, 2018).
- Konkoli, Z. et al. Computational Matter, chap. Philosophy of Computation, 153–184 (Springer, 2018).
- Computational Matter, chap. Computability and Complexity of Unconventional Computing Devices, 185–229 (Springer, 2018).
- Computational Matter, chap. Encoding and Representation of Information Processing in Irregular Computational Matter, 231–248 (Springer, 2018).
- Deutsch, D. Constructor theory. Synthese 190, 4331–4359 (2013).
- Constructor theory of information. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 471, 20140540 (2015).
- Marletto, C. Constructor theory of life. Journal of The Royal Society Interface 12, 20141226 (2015).
- The beauty and utility of dna origami. Chem 2, 359–382 (2017).
- Karp, R. M. Reducibility among Combinatorial Problems, 85–103 (Springer US, 1972).
- Feynman, R. Plenty of room at the bottom. Transcript of a talk given to the American Physical Society (1959).
Paper Prompts
Sign up for free to create and run prompts on this paper.