Skip to main content

Introduction

  • Chapter
  • First Online:
The Foundations of Computability Theory
  • 1463 Accesses

Abstract

The central notions in this book are those of the algorithm and computation, not a particular algorithm for a particular problem or a particular computation, but the algorithm and computation in general. The first algorithms were discovered by the ancient Greeks. Faced with a specific problem, they asked for a set of instructions, whose execution in the prescribed order would eventually provide the solution to the problem. This view of the algorithm sufficed since the fourth century B.C.E., which meant there was no need to ask questions about algorithms and computation in general.

A recipe is a set of instructions describing how to prepare something. A culinary recipe for a dish consists of the required ingredients and their quantities, equipment and environment needed to prepare the dish, an ordered list of preparation steps, and the texture and flavor of the dish.

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 59.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.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.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Borut Robič .

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Robič, B. (2015). Introduction. In: The Foundations of Computability Theory. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44808-3_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-44808-3_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-44807-6

  • Online ISBN: 978-3-662-44808-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics