Häftad, Engelska, 1997
Complexity, Logic, and Recursion Theory
Av Andrea Sorbi
2869 kr
Tillfälligt slut
Beskrivning
"Integrates two classical approaches to computability. Offers detailed coverage of recent research at the interface of logic, computability theory, nd theoretical computer science. Presents new, never-before-published results and provides informtion not easily accessible in the literature."
Produktinformation
- Utgivningsdatum: 1997-02-04
- Mått: 210 x 280 x undefined mm
- Vikt: 635 g
- Format: Häftad
- Språk: Engelska
- Serie: Lecture Notes in Pure and Applied Mathematics
- Antal sidor: 384
- Förlag: Taylor & Francis Inc
- ISBN: 9780824700263
Utforska kategorier
Betyg & recensioner
0 recensioner
Inga recensioner tillgängliga.