Skip to main content

Countability and Uncountability: The Precursors of “Encoding”

  • Chapter
  • First Online:
The Pillars of Computation Theory

Part of the book series: Universitext ((UTX))

  • 1593 Accesses

Abstract

The theory of countability (and uncountability) began with Georg Cantor’s deliberations on the nature of infinity [10]. Cantor concentrated on questions that can be framed intuitively as follows: Are there “more” rational numbers than integers? Are there “more” real numbers than integers? (Note that we need to put “more” in quotes, because all three sets, the integers, the rational numbers, and the real numbers, are infinite—so what does “more” mean?)

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 39.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.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Arnold L. Rosenberg .

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag New York

About this chapter

Cite this chapter

Rosenberg, A.L. (2010). Countability and Uncountability: The Precursors of “Encoding”. In: The Pillars of Computation Theory. Universitext. Springer, New York, NY. https://doi.org/10.1007/978-0-387-09639-1_7

Download citation

Publish with us

Policies and ethics