An Enquiry Concerning Human (and Computer!) [Mathematical] Understanding C.S. Calude, ed., "Randomness & Complexity, from Leibniz to Chaitin", World Scientific, Singapore, (October 2007)
Context: Algorithms existed for at least five thousand years, but people did not know that they were algorithmizing. Then came Turing (and Post and Church and Markov and others) and formalized the notion.
“An algorithm must be seen to be believed.”
Vol. I, Fundamental Algorithms, Section 1.1 (1968)
The Art of Computer Programming (1968–2011)
Source: Leaders in Computing: Changing the digital world
[3] Metaphor, 3.12. Conclusions
Semiotics and the Philosophy of Language (1984)
Context: No algorithm exists for the metaphor, nor can a metaphor be produced by means of a computer's precise instructions, no matter what the volume of organized information to be fed in. The success of a metaphor is a function of the sociocultural format of the interpreting subjects' encyclopedia. In this perspective, metaphors are produced solely on the basis of a rich cultural framework, on the basis, that is, of a universe of content that is already organized into networks of interpretants, which decide (semiotically) the identities and differences of properties. At the same time, content universe, whose format postulates itself not as rigidly hierarchized but, rather, according to Model Q, alone derives from the metaphorical production and interpretation the opportunity to restructure itself into new nodes of similarity and dissimilarity.
in Discussion on Corpora-list (2 February 2015) http://mailman.uib.no/public/corpora/2015-February/021917.html
The Narrow-Minded and Ignorant Referee's Report [and Zeilberger's Response] of Zeilberger's Paper "Automaric CounTilings" that was rejected by Helene Barcelo and the Members of the Advisory Board [that includes(!) Enumeration Expert Mireille Bousquet-Melou] of the Journal of Combinatorial Theory-Series A. http://www.math.rutgers.edu/~zeilberg/RefTipesh.html
Michael A. Jackson. "A system development method," in: Tools and notions for program construction: An advanced course, Cambridge University Press, 1982. p. 1
New Theories of Everything (2007)
Context: We say that the string is 'random' if there is no other representation of the string which is shorter than itself. But we will say that it is 'non-random' if there does exist such an abbreviated representation.... In general, the shorter the possible representation... the less random... On this view we recognize science to be the search for algorithmic compressions.<!--Ch. 1, p. 11
Memo to the Amateur Cipher Designer, Schneier, Bruce, 1998-10-15, Cryptogram newsletter http://www.schneier.com/crypto-gram-9810.html#cipherdesign, (aka Schneier's Law)
Cryptography
Source: Why Stock Markets Crash - Critical Events in Complex Systems (2003), Chapter 5, Modeling Financial Bubbles And Market Crashes, p. 134.
Plenary speech, http://www.youtube.com/watch?v=8_3OCq_vTWM AAAS Annual conference, San Francisco (February 2007).
