Written by distinguished international experts from seven countries, Complexity, Logic, and Recursion Theory examines structural complexity theory...resource-bounded measure and randomness...Kolmogorov complexity and inductive inference...global and local degree theory... complexity and recursion theoretic reducibilities...degree structures...algebra and topology versus logic...effective algebra and bounded arithmetic...and more. Containing over 600 bibliographic citations for more in-depth study of particular topics, Complexity, Logic, and Recursion Theory is an excellent resource for complexity and recursion theorists; theoretical computer scientists; logicians; algebraists; and upper-level undergraduate and graduate students in these disciplines.
2008-09-24, Amazon. This $200 monstrosity, said to be the most exciting thing in FoC since Scott Aaronson's dissertation, suddenly showed up on Amazon for $25 from three sellers -- I swear to god, the used book racket's running the same software the QCF (qualitative and computational finance, aka doing ODE's (ordinary differential equations) 22 hours a day for three-quarters of a million per annum from goldman sachs or merrill lynch...well, maybe not ML anymore, har de har har) guys wrote for the stock market racket, likely purchased from the Ukranian code repackaging scene.
Well, I just got my ass handed to me by a textbook in a way I've not experienced for several years. I quite honestly have precious little idea what this book is about, despite having leafed through it for an hour and spent some time frontloading concepts. Dammit, I hate knowing there's people this much better-trained and intelligent than me regarding any area of computer science, grrrrrrrrr! For whatever it's worth, things did look fairly well put-together for anyone who speaks largely in terms of Komolgorov complexity algebras (I was fine up until the "algebras of complexity" there, at which point my brain melted). Damnit damnit damnit why am I not smarter? [froth]