Skip to main content
SpringerLink
Log in

Algorithms as machines

  • Classroom
  • Published:
Resonance Aims and scope Submit manuscript

Abstract

To solve problems occurring in the real world, computing scientists devise algorithms. These algorithms are programmed on computers and used to solve the problems. But computing scientists also talk about ‘machines’ of various kinds, such as Turing machines, Mealy machines and von Neumann machines. (These are quite different from actual computers.) This article examines how algorithms turn into machines. The problems considered are the very elementary ones of addition, multiplication and factoring.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Suggested Reading

  1. Resonance, Vol.2, No.7, 1997.

    Google Scholar 

  2. N Kayal and N Saxena, Resonance, Vol.7, No.11, pp.77–79, 2002.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Institute of Mathematical Sciences, C.I.T Campus, Chennai, 600 113, India

    Kamal Lodaya

Authors
  1. Kamal Lodaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kamal Lodaya.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lodaya, K. Algorithms as machines. Reson 14, 367–379 (2009). https://doi.org/10.1007/s12045-009-0037-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12045-009-0037-1

Keywords

Search

Navigation