1999
DOI: 10.1002/(sici)1099-0526(199907/08)4:6<22::aid-cplx4>3.0.co;2-o
|Get access via publisher |Summarize |Cite
Complexity and hierarchy: A level rule
Search citation statements
Paper Sections
Select...
7
0
0
0
Citation Types
0
2
0
0
Year Published
2001
2022
Publication Types
Select...
6
1
Relationship
0
7
Authors
Journals
Cited by 7 publications
(2 citation statements)
References 9 publications
0
2
0
0
“…Furthermore, the distinctions in computer science (e.g., Hornby, 2007) should not be meant as well. Yagil (1999) investigates the link of hierarchy to complexity, and Zheng, Weihrauch (2001): how real numbers can be represented by arithmetical hierarchy (meaning that all real numbers are well-ordered sets of natural numbers, infinite in general).…”
mentioning
confidence: 99%
“…Furthermore, the distinctions in computer science (e.g., Hornby, 2007) should not be meant as well. Yagil (1999) investigates the link of hierarchy to complexity, and Zheng, Weihrauch (2001): how real numbers can be represented by arithmetical hierarchy (meaning that all real numbers are well-ordered sets of natural numbers, infinite in general).…”
mentioning
confidence: 99%
“…Hornby 2007) should not be meant as well. Yagil (1999) investigates the link of hierarchy to complexity, and Zheng, Weihrauch (2001): how real numbers can be represented by arithmetical hierarchy (meaning that all real numbers are well-ordered sets of natural numbers, infinite in general) .…”
Section: Instead Of Introduction: the Fruitful Tension Of Idempotency...mentioning
confidence: 99%
