このページのリンク

Bounded Queries in Recursion Theory / by William I. Gasarch, Georgia A. Martin
(Progress in Computer Science and Applied Logic ; 16)

データ種別 電子ブック
出版者 Boston, MA : Birkhäuser Boston : Imprint: Birkhäuser
出版年 1999
本文言語 英語
大きさ XIII, 353 p : online resource

所蔵情報を非表示

URL 電子ブック


EB0062769

書誌詳細を非表示

内容注記 A: Getting Your Feet Wet
1 Basic Concepts
2 Bounded Queries and the Halting Set
3 Definitions and Questions
B: The Complexity of Functions
4 The Complexity of CnA
5 #nA and Other Functions
C: The Complexity of Sets
6 The Complexity of ODDnA and MODmnA
7 Q Versus QC
8 Separating and Collapsing Classes
D: Miscellaneous
9 Nondeterministic Complexity
10 The Literature on Bounded Queries
References
一般注記 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
著者標目 *Gasarch, William I. author
Martin, Georgia A. author
SpringerLink (Online service)
件 名 LCSH:Computer science
LCSH:Computers
LCSH:Computer science -- Mathematics  全ての件名で検索
LCSH:Operator theory
LCSH:Applied mathematics
LCSH:Engineering mathematics
LCSH:Computer mathematics
FREE:Computer Science
FREE:Math Applications in Computer Science
FREE:Operator Theory
FREE:Theory of Computation
FREE:Discrete Mathematics in Computer Science
FREE:Computational Mathematics and Numerical Analysis
FREE:Applications of Mathematics
分 類 DC23:004.0151
巻冊次 ISBN:9781461206354 REFWLINK
ISBN 9781461206354
URL http://dx.doi.org/10.1007/978-1-4612-0635-4
目次/あらすじ

 類似資料