A Computable Economist’s Perspective on Computational Complexity
K. Vela Velupillai · Edward Elgar Publishing eBooks · 2009
Zambelli have been educating me, from di¤erent points of view, on many fascinating visions of the thorny concept of complexity.More than a decade and a half of constant, stimulating, discussions with John McCall on Kolmogorovalgorithmic -complexity and theories of probability have been a source of great pleasure and consistent intellectual adventures.Not being particularly competent in the actual programming of theoretically structured computing models, I have had to rely on Stefano Zambelli for instruction and advice on the felicitous link between theory and application that is the hall mark of computational complexity theory.More recently, I have had the pleasure and privilege of being able to pick Chico Doria's fertile brain for exotic ideas about the P =?N P question.Years ago, now bordering on almost two decades, the decision by Shu-Heng Chen to write his UCLA dissertation on the application of algorithmic and stochastic complexity theories, with me as his main thesis advisor, forced me to try to be at least one-step ahead of his incredible learning abilities.Barkley Rosser's stimulating visit to Trento last year provided much inspiration on many topics related to a broader perspective on complexity.I wish I could blame them, and not have to plead guilty, for the infelicities and errors that remain! 1