My Account Log in

1 option

Computability theory : an introduction to recursion theory / Herbert B. Enderton.

Math/Physics/Astronomy Library QA9.6 .E53 2011
Loading location information...

Available This item is available for access.

Log in to request item
Format:
Book
Author/Creator:
Enderton, Herbert B.
Language:
English
Subjects (All):
Recursion theory.
Physical Description:
viii, 174 pages : illustrations ; 24 cm
Place of Publication:
Amsterdam ; Boston : Academic Press, [2011]
Contents:
The computability concept
General recursive functions
Programs and machines
Recursive enumerability
Connections to logic
Degrees of unsolvability
Polynomial-time computability
A1: Mathspeak
A2: Countability
A3: Decadic Notation.
Notes:
Includes bibliographical references and index.
ISBN:
9780123849588
0123849586
OCLC:
641524716
Publisher Number:
99942301236

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account