This is a review of a book of the same title written by Cristian Calude. A discussion is presented of the elements of computability and complexity theory and the origins of the theory discussed. The book is said to contain enough information for several different courses from undergraduate introduction to advanced graduate courses in algorithms and complexity (including the theories of Blum, Kolmogorov and Martin‐Löf).
CitationDownload as .RIS
MCB UP Ltd
Copyright © 1990, MCB UP Limited