Marknadens största urval
Snabb leverans

Abstract Recursion and Intrinsic Complexity

Om Abstract Recursion and Intrinsic Complexity

The author presents and applies a new framework for studying the complexity of algorithms. The book is aimed at logicians, computer scientists, mathematicians and philosophers who are interested in the theory of computation and its foundations. It includes an accessible introduction to abstract recursion theory and contains over 250 problems.

Visa mer
  • Språk:
  • Engelska
  • ISBN:
  • 9781108415583
  • Format:
  • Inbunden
  • Sidor:
  • 250
  • Utgiven:
  • 6. december 2018
  • Mått:
  • 157x235x18 mm.
  • Vikt:
  • 470 g.
  Fri leverans
Leveranstid: 2-4 veckor
Förväntad leverans: 19. december 2024
Förlängd ångerrätt till 31. januari 2025

Beskrivning av Abstract Recursion and Intrinsic Complexity

The author presents and applies a new framework for studying the complexity of algorithms. The book is aimed at logicians, computer scientists, mathematicians and philosophers who are interested in the theory of computation and its foundations. It includes an accessible introduction to abstract recursion theory and contains over 250 problems.

Användarnas betyg av Abstract Recursion and Intrinsic Complexity



Hitta liknande böcker
Boken Abstract Recursion and Intrinsic Complexity finns i följande kategorier:

Gör som tusentals andra bokälskare

Prenumerera på vårt nyhetsbrev för att få fantastiska erbjudanden och inspiration för din nästa läsning.