Skip to main content
SpringerLink
Log in
Book cover

Computability

  • Textbook
  • © 1987

Overview

Authors:
  1. Klaus Weihrauch

    1. FB Mathematik und Informatik, Fern Universität Hagen, Hagen, Germany

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Monographs in Theoretical Computer Science. An EATCS Series (EATCS, volume 9)

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

Access this book

Log in via an institution
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

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (31 chapters)

  1. Front Matter

    Pages I-X
    Download chapter PDF

  2. Prerequisites and Notation

    1. Prerequisites and Notation

      • Klaus Weihrauch
      Pages 1-3

  3. Basic Concepts of Computability

    1. Front Matter

      Pages 4-4
      Download chapter PDF

    2. Flowcharts and Machines

      • Klaus Weihrauch
      Pages 5-23

    3. Register Machines and Register Computability

      • Klaus Weihrauch
      Pages 24-41

    4. Primitive Recursive and μ-Recursive Functions

      • Klaus Weihrauch
      Pages 42-52

    5. WHILE-Programs and WHILE-Computability

      • Klaus Weihrauch
      Pages 53-58

    6. Tape Machines

      • Klaus Weihrauch
      Pages 59-69

    7. Stack Machines

      • Klaus Weihrauch
      Pages 70-78

    8. Comparison of Number and Word Functions, Church’s Thesis

      • Klaus Weihrauch
      Pages 79-92

    9. Recursive and Recursively Enumerable Sets

      • Klaus Weihrauch
      Pages 93-102

    10. The Standard Numbering φ of P(1)

      • Klaus Weihrauch
      Pages 103-122

    11. Some Unsolvable Problems

      • Klaus Weihrauch
      Pages 123-136

  4. Type 1 Recursion Theory

    1. Front Matter

      Pages 137-137
      Download chapter PDF

    2. The Basic Concepts of Computability Theory

      • Klaus Weihrauch
      Pages 138-143

    3. Numberings

      • Klaus Weihrauch
      Pages 144-158

    4. Recursive and Recursively Enumerable Sets (Continued)

      • Klaus Weihrauch
      Pages 159-176

    5. Many-one and One-one Reducibility

      • Klaus Weihrauch
      Pages 177-190

    6. The Recursion Theorem

      • Klaus Weihrauch
      Pages 191-204

    7. Creative, Productive, Complete Sets

      • Klaus Weihrauch
      Pages 205-215
Back to top

Keywords

Authors and Affiliations

  • FB Mathematik und Informatik, Fern Universität Hagen, Hagen, Germany

    Klaus Weihrauch

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation