Quotes about algorithm

A collection of quotes on the topic of algorithm, use, computer, problem.

Quotes about algorithm

Nicholas Negroponte photo

“When you write a computer program you've got to not just list things out and sort of take an algorithm and translate it into a set of instructions. But when there's a bug — and all programs have bugs — you've got to debug it. You've got to go in, change it, and then re-execute … and you iterate. And that iteration is really a very, very good approximation of learning.”

Nicholas Negroponte (1943) American computer scientist

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)

Lotfi A. Zadeh photo
Donald Ervin Knuth photo

“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

Johannes Grenzfurthner photo

“I often think, if NLP people put as much effort into the training data as the algorithms, our systems would perform much better.”

Adam Kilgarriff (1960–2015) linguist from England

in Discussion on Corpora-list (2 February 2015) http://mailman.uib.no/public/corpora/2015-February/021917.html

Ken Thompson photo
Yuval Noah Harari photo
George Dantzig photo

“One of the first applications of the simplex algorithm was to the determination of an adequate diet that was of least cost. In the fall of 1947, Jack Laderman of the Mathematical Tables Project of the National Bureau of Standards undertook, as a test of the newly proposed simplex method, the first large-scale computation in this field. It was a system with nine equations in seventy-seven unknowns. Using hand-operated desk calculators, approximately 120 man-days were required to obtain a solution. … The particular problem solved was one which had been studied earlier by George Stigler (who later became a Nobel Laureate) who proposed a solution based on the substitution of certain foods by others which gave more nutrition per dollar. He then examined a "handful" of the possible 510 ways to combine the selected foods. He did not claim the solution to be the cheapest but gave his reasons for believing that the cost per annum could not be reduced by more than a few dollars. Indeed, it turned out that Stigler's solution (expressed in 1945 dollars) was only 24 cents higher than the true minimum per year $39.69.”

George Dantzig (1914–2005) American mathematician

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)

Newton Lee photo
Jack Valenti photo
George Dantzig photo
Maurice Wilkes photo
Charles Stross photo
Alexander Stepanov photo
Edsger W. Dijkstra photo
Daniel Levitin photo
Jacques Bertin photo
Jorge Majfud photo
Max Barry photo
Doron Zeilberger photo

“Mathematics my foot! Algorithms are mathematics too, and often more interesting and definitely more useful.”

Doron Zeilberger (1950) Israeli mathematician

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

Zygmunt Vetulani photo
Didier Sornette photo

“Knowledge is encoded in models. Models are synthetic sets of rules, and pictures, and algorithms providing us with useful representations of the world of our perceptions and of their patterns.”

Didier Sornette (1957) French scientist

Source: Why Stock Markets Crash - Critical Events in Complex Systems (2003), Chapter 5, Modeling Financial Bubbles And Market Crashes, p. 134.

Larry Page photo

“I have a simple algorithm, which is, wherever you see paid researchers instead of grad students, that's not where you want to be doing research.”

Larry Page (1973) American computer scientist and Internet entrepreneur

Plenary speech, http://www.youtube.com/watch?v=8_3OCq_vTWM AAAS Annual conference, San Francisco (February 2007).

Bruce Schneier photo

“Anyone, from the most clueless amateur to the best cryptographer, can create an algorithm that he himself can't break.”

Bruce Schneier (1963) American computer scientist

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

Eliezer Yudkowsky photo

“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.”

Eliezer Yudkowsky (1979) American blogger, writer, and artificial intelligence researcher

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.

John D. Barrow photo

“In general, the shorter the possible representation… the less random… On this view we recognize science to be the search for algorithmic compressions.”

John D. Barrow (1952–2020) British scientist

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

Eliezer Yudkowsky photo

“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.”

Eliezer Yudkowsky (1979) American blogger, writer, and artificial intelligence researcher

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.

Umberto Eco photo

“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.”

[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.

Doron Zeilberger photo

“Algorithms existed for at least five thousand years, but people did not know that they were algorithmizing.”

Doron Zeilberger (1950) Israeli mathematician

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.

Yuval Noah Harari photo

“This (machine learning algorithm that can predict SARS-CoV-2 virus mutations) is a real-time companion to vaccine development. What we can do with our model right now is a lot faster than what you can do in the lab.”

Bryan Bryson researcher (ORCID 0000-0003-1716-6712)

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.