Skip to main content

Balance Machines: Computing = Balancing

  • Chapter
Aspects of Molecular Computing

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2950))

Abstract

We propose a natural computational model called a balance machine. The computational model consists of components that resemble ordinary physical balances, each with an intrinsic property to automatically balance the weights on their left, right pans. If we start with certain fixed weights (representing inputs) on some of the pans, then the balance–like components would vigorously try to balance themselves by filling the rest of the pans with suitable weights (representing the outputs). This balancing act can be viewed as a computation. We will show that the model allows us to construct those primitive (hardware) components that serve as the building blocks of a general purpose (universal) digital computer: logic gates, memory cells (flip-flops), and transmission lines. One of the key features of the balance machine is its “bidirectional” operation: both a function and its (partial) inverse can be computed spontaneously using the same machine. Some practical applications of the model are discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arulanandham, J.J., Calude, C.S., Dinneen, M.J.: Solving SAT with bilateral computing. Romanian Journal of Information Science and Technology (2003) (to appear)

    Google Scholar 

  2. Balcázar, J.L., Díaz, J., Gabarró, J.: Structural Complexity I. Springer, Berlin (1988)

    Google Scholar 

  3. Fredkin, E., Toffoli, T.: Conservative logic. Int’l J. Theoret. Phys. 21, 219–253 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  4. Savage, J.E.: Models of Computation. Addison–Wesley, Reading (1998)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Arulanandham, J.J., Calude, C.S., Dinneen, M.J. (2003). Balance Machines: Computing = Balancing. In: Jonoska, N., Păun, G., Rozenberg, G. (eds) Aspects of Molecular Computing. Lecture Notes in Computer Science, vol 2950. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24635-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24635-0_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20781-8

  • Online ISBN: 978-3-540-24635-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics