Super-recursive algorithms
By: Burgin, Mark.
Material type:
BookPublisher: New York: Springer-Verlag, 2004Description: xii, 304 p.; ill.: 24 cm.ISBN: 9780387955698 .Subject(s): Algorithms | Recursive functionsDDC classification: 511.352
| Item type | Current location | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
| Books | 511.352 BUR (Browse shelf) | Available | 013463 |
Browsing DAIICT Shelves Close shelf browser
| 511.35 ZEN Irreducibility and computational equivalence : 10 years after Wolfram's a new kind of Science | 511.352 ARO Computational complexity : a modern approach | 511.352 BOO Computability and logic | 511.352 BUR Super-recursive algorithms | 511.352 BUR Completeness and reduction in algebraic complexity theory | 511.352 COP Computability : Turing, Godel, Church, and beyond | 511.352 FOR Golden ticket : P, NP, and the search for the impossible |
There are no comments for this item.