Automata, computability and complexity : theory and applications
Material type: TextLanguage: English Publication details: Pearson 2012 Description: xx, 1098pISBN: 9788131788226 (PB)Subject(s): Machine theory | Computable functions | Computational complexityDDC classification: 511.3 RIC(AUT)Item type | Current library | Call number | Materials specified | Copy number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|---|
Books | Central Library | 511.3 RIC(AUT) (Browse shelf(Opens below)) | 1 | Checked out | 02/20/2024 | 36932 |
Total holds: 0
Browsing Central Library shelves Close shelf browser (Hides shelf browser)
No cover image available | ||||||||
511.3 MOO(ZER) Zermelo's axiom of choice : its origins, development, and influence | 511.3 MOR(THE) The theory of computation | 511.3 NED(TYP) Type theory and formal proof : an introduction | 511.3 RIC(AUT) Automata, computability and complexity : theory and applications | 511.3 SAC(DEG) Degrees of unsolvability | 511.3 SCH(USE) The use of ultraproducts in commutative algebra | 511.3 SIE(BUC) Buchis Monadic second order successor arithmetic |
There are no comments on this title.