Robust Kalman Filtering for Signals and Systems with Large Uncertainties
Ian Petersen, Andrey Savkin, William Levine
Inbunden, 1999
939 kr
Bounded Queries in Recursion Theory
AvWilliam Levine,Georgia Martin
Inbunden, Engelska, 1998
Del i serien Progress in Computer Science and Applied Logic
1 104 kr
Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.
Fler format och utgåvor
Beskrivning
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.
Produktinformation
Utforska kategorier
Recensioner i media
Innehållsförteckning
Hoppa över listan
Mer från samma serie
Applied Probability-Computer Science: The Interface Volume 1
Ralph L. Disney, Teunis J. Ott
Inbunden, 1982
547 kr
Applied Probability— Computer Science: The Interface
Ralph L. Disney, Teunis J. Ott
Häftad, 1982
547 kr
Del 4
Notes on Introductory Combinatorics
George Polya, Robert E. Tarjan, Donald R. Woods
Häftad, 1990
884 kr
Del 5
Del 6
Del 7
Del 9
Del 10
Del 11
Hoppa över listan
Du kanske också är intresserad av
- 10% rabatt på allt
Del 16
Robust Kalman Filtering for Signals and Systems with Large Uncertainties
Ian Petersen, Andrey Savkin, William Levine
Inbunden, 1999
939 kr
- 10% rabatt på allt
Del 7
Del 25
Del 13
Del 23
Coding, Cryptography and Combinatorics
Keqin Feng, Harald Niederreiter, Chaoping Xing
Häftad, 2012
1 102 kr