Nicholas Negroponte: A 30-year history of the future http://www.ted.com/talks/nicholas_negroponte_a_30_year_history_of_the_future, July 2014, TED Talks (about 13:40 into 19:43 video).
A 30-year history of the future, TED Talk (2014)
Quotes about algorithm
A collection of quotes on the topic of algorithm, use, computer, problem.
Quotes about algorithm
Source: 1970s, Outline of a new approach to the analysis of complex systems and decision processes (1973), p. 30
“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
via Boing Boing http://boingboing.net/2016/04/14/the-story-of-traceroute-about.html
in Discussion on Corpora-list (2 February 2015) http://mailman.uib.no/public/corpora/2015-February/021917.html
Ken Thompson; cited in
"Coders At Work", 2009
Source: Object-oriented modeling and design (1990), p. 155; as cited in: Roger Chiang et al (2009, p. 165)
cited in: John J. O'Connor & Edmund F.; Robertson (2003) " George Dantzig http://www-history.mcs.st-and.ac.uk/Biographies/Dantzig_George.html". in: MacTutor History of Mathematics archive, University of St Andrews.
Linear programming and extensions (1963)
Counterterrorism and Cybersecurity: Total Information Awareness (2nd Edition), 2015
Source: Linear programming and extensions (1963), p. vii.
"A Half Century of Surprises", in Talking Back to the Machine: Computers and Human Aspiration, Ed. Peter J. Denning, Springer, 1999, ISBN 0387984135, p. 112
[Calculus as an Experimental Science, 78, 6, 1971, 664–667, The American Mathematical Monthly, 10.2307/2316582]
Michael A. Jackson. "A system development method," in: Tools and notions for program construction: An advanced course, Cambridge University Press, 1982. p. 1
An Interview with A. Stepanov by Graziano Lo Russo, 2008-04-25 http://www.stlport.org/resources/StepanovUSA.html,
Dijkstra (2001), in an interview with Philip L. Frana. (OH 330; Communications of the ACM 53(8):41–47)
2000s
"A Republic, If You Can Keep It" https://web.archive.org/web/20140327090001/http://www.thatsmags.com/shanghai/articles/12321 (2013) (original emphasis)
About the traditionally low interest in theory of graphics
Interview with Jacques Bertin (2003)
Carta abierta a Donald Trump http://www.huffingtonpost.es/jorge-majfud/carta-abierta-a-donald-tr_b_10218246.html Translation at The Huffington Post http://www.huffingtonpost.com/entry/57dc39fee4b0d5920b5b2aac?timestamp=1474051083758.
August 8, 2005 weblog post http://www.maxbarry.com/2005/08/08/news.html#girlyman
Source: Software Engineering: Principles and Practice, 2007, p. 2
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
Tumiłowicz, Bronisław (February 2018): Zrób sobie mózg https://www.tygodnikprzeglad.pl/zrob-sobie-mozg/. Przegląd (6/2018): pp. 58–59.
1978 Turing Award Citation https://web.archive.org/web/20070708004814/http://awards.acm.org/citation.cfm?id=4173633&srt=all&aw=140&ao=AMTURING.
About
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).
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
How an Algorithm Feels from the Inside http://lesswrong.com/lw/no/how_an_algorithm_feels_from_inside/, (February 2008)
Context: People cling to their intuitions, I think, not so much because they believe their cognitive algorithms are perfectly reliable, but because they can't see their intuitions as the way their cognitive algorithms happen to look from the inside. And so everything you try to say about how the native cognitive algorithm goes astray, ends up being contrasted to their direct perception of the Way Things Really Are—and discarded as obviously wrong.
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
Predictible Fakers (January 2009) http://www.overcomingbias.com/2009/01/predictible-fakers.html
Context: My experience is that journalists report on the nearest-cliche algorithm, which is extremely uninformative because there aren’t many cliches, the truth is often quite distant from any cliche, and the only thing you can infer about the actual event was that this was the closest cliche.... It is simply not possible to appreciate the sheer awfulness of mainstream media reporting until someone has actually reported on you. It is so much worse than you think.
[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.
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.
Source: Bryan Bryson (2021) cited in " As COVID-19 Mutates, AI Algorithms Keep Pace https://spectrum.ieee.org/the-human-os/biomedical/devices/ai-predicts-most-potent-covid-19-mutations" on IEEE Spectrum, 20 January 2021.