Diversity of speed-ups and embeddability in computational complexity
Journal of Symbolic Logic 41 (1):199-214 (1976)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,865 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesMarcin Mostowski & Jakub Szymanik (2007). Computational Complexity of Some Ramsey Quantifiers in Finite Models. The Bulletin of Symbolic Logic 13:281--282.
Jakub Szymanik (2010). Computational Complexity of Polyadic Lifts of Generalized Quantifiers in Natural Language. Linguistics and Philosophy 33 (3):215-250.
Gregory J. Chaitin (1970). Computational Complexity and Godel's Incompleteness Theorem. [Rio De Janeiro,Centro Técnico Científico, Pontifícia Universidade Católica Do Rio De Janeiro.
Jakub Szymanik (2009). The Computational Complexity of Quantified Reciprocals. In Peter Bosch, David Gabelaia & Jérôme Lang (eds.), Lecture Notes on Artificial Intelligence 5422, Logic, Language, and Computation 7th International Tbilisi Symposium on Logic, Language, and Computation. Springer.
John Helm & Paul Young (1971). On Size Vs. Efficiency for Programs Admitting Speed-Ups. Journal of Symbolic Logic 36 (1):21-27.
James S. Royer (1989). Two Recursion Theoretic Characterizations of Proof Speed-Ups. Journal of Symbolic Logic 54 (2):522-526.
Alberto Marcone & Christian Rosendal (2004). The Complexity of Continuous Embeddability Between Dendrites. Journal of Symbolic Logic 69 (3):663-673.
Martin K. Solomon (1978). Some Results on Measure Independent Gödel Speed-Ups. Journal of Symbolic Logic 43 (4):667-672.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads2 ( #234,650 of 556,807 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
