Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 117,12
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 117,12
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
EUR 123,19
Anzahl: 1 verfügbar
In den WarenkorbZustand: Used. pp. 376 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.
Zustand: Used. pp. 376.
EUR 92,27
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - One of the major concerns of theoretical computer science is the classifi cation of problems in terms of how hard they are. The natural measure of difficulty of a function is the amount of time needed to compute it (as a function of the length of the input). Other resources, such as space, have also been considered. In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it. We wish to classify functions that are hard, i.e., not computable, in a quantitative way. We cannot use time or space, since the functions are not even computable. We cannot use Turing degree, since this notion is not quantitative. Hence we need a new notion of complexity-much like time or spac~that is quantitative and yet in some way captures the level of difficulty (such as the Turing degree) of a function.
EUR 128,20
Anzahl: Mehr als 20 verfügbar
In den WarenkorbGebunden. Zustand: New.