2001
DOI: 10.1007/978-1-4757-3544-4
|View full text |Cite
|
Sign up to set email alerts
|

Computability and Complexity Theory

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
38
0
2

Year Published

2005
2005
2009
2009

Publication Types

Select...
4
3
2

Relationship

2
7

Authors

Journals

citations
Cited by 61 publications
(40 citation statements)
references
References 0 publications
0
38
0
2
Order By: Relevance
“…By complexity I mean that musical signals (like linguistic signals) are more complex than the various innate vocalization available in our species (groans, sobs, laughter and shouts). Although complexity can be measured and quantified in various ways (see, e.g., Homer & Selman, 2001;Shmulevich & Povel, 2000;Simon, 1972;Weng, Bhalla, & Iyengar, 1999), there is no single widely used metric applicable to all musics (Pressing, 1998), so it would be premature to specify any absolute threshold for ''complexity'' at present. Oddly, Hockett did not include complexity on his list of design features, although its necessity for language is implicit in his discussion.…”
Section: Linguistic Comparisons: Design Features Of Human Musicmentioning
confidence: 99%
“…By complexity I mean that musical signals (like linguistic signals) are more complex than the various innate vocalization available in our species (groans, sobs, laughter and shouts). Although complexity can be measured and quantified in various ways (see, e.g., Homer & Selman, 2001;Shmulevich & Povel, 2000;Simon, 1972;Weng, Bhalla, & Iyengar, 1999), there is no single widely used metric applicable to all musics (Pressing, 1998), so it would be premature to specify any absolute threshold for ''complexity'' at present. Oddly, Hockett did not include complexity on his list of design features, although its necessity for language is implicit in his discussion.…”
Section: Linguistic Comparisons: Design Features Of Human Musicmentioning
confidence: 99%
“…We adopt the standard definitions and notations for well-known complexity classes, and other notions of computational complexity, as can be found, e.g., in [6] and [24]. We use the standard paring function denoted a, b for binary strings a, b, where | a, b | = 2|a| + |b| + 2.…”
Section: Notationmentioning
confidence: 99%
“…Since max(g 1 , g 2 , g 3 ) + 1 is a total computable function, there exists a fast function 1 g such that for all n, g(n) > max(g 1 (n), g 2 (n), g 3 (n)) (We refer to Proposition 7.3 of the text by Homer and Selman [HS01].) Also, G[g] ∈ P (Lemma 7.1, [HS01]).…”
Section: Claim 44 For Allmentioning
confidence: 99%