Skip to main content

Turing Machines as Computers

  • Chapter
  • First Online:
A Concise Introduction to Languages and Machines

Part of the book series: Undergraduate Topics in Computer Science ((UTICS))

  • 2634 Accesses

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.95
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

Notes

  1. 1.

    Since MULT will use ADD, the sub-machines we define for MULT may need to take account of symbols used by ADD, such as C (the carry indicator), and so on.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alan P. Parkes .

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag London Limited

About this chapter

Cite this chapter

Parkes, A.P. (2008). Turing Machines as Computers. In: A Concise Introduction to Languages and Machines. Undergraduate Topics in Computer Science. Springer, London. https://doi.org/10.1007/978-1-84800-121-3_9

Download citation

  • DOI: https://doi.org/10.1007/978-1-84800-121-3_9

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84800-120-6

  • Online ISBN: 978-1-84800-121-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics