Image from Amazon.com
Theories of computability / by Nicholas Pippenger
Material type:
TextLanguage: English Publication details: New York: Cambridge University Press, 1997. Description: ix, 251pISBN: 0521553806Subject(s): Automata | Computability | Logical expressions | MathDDC classification: 511.3
| Item type | Current library | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
Books
|
NBHM LIBRARY General Stacks | Available | MAT/5902 | ||
|
Books
|
PROF. BHUBANESWAR BEHERA CENTRAL LIBRARY | 511.3 PIP/T (Browse shelf(Opens below)) | Available | 114313 |
Browsing PROF. BHUBANESWAR BEHERA CENTRAL LIBRARY shelves Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| 511.3 MAO/T To Infinity and Beyond A Cultural History of the Infinite | 511.3 PET/R Recursive functions in computer theory | 511.3 PIL/A An Introduction to stability theory | 511.3 PIP/T Theories of computability | 511.3 POL/H How To Solve It : A New Aspect Of Mathematical Method | 511.3 ROS/F Fuzzy Logic with Engineering Applications | 511.3 ROS/F Fuzzy Logic with Engineering Applications |
There are no comments on this title.