Jump to content

Talk:Algorithm/to do

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
< Talk:Algorithm
This is an old revision of this page, as edited by Mlpkr (talk | contribs) at 01:31, 24 August 2006. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
  • Cleanup the article.
    • move most of the information added in history to a page like "history of computing" and keep absolutely related history to algorithm here.
    • give references to other pages and do not write more than simple paragraph about all those different formalisations here.

This article was used to be so nice to explain what algorithm is, and its brief history and list various algorithms and fundamentals. It was good reference for people looking for information on algorithm or for that matter for non computer scientists. Honestly it is boring and prosiac now and scares away any quicktime readers.

  • Rewrite the history section
    • Ancient algorithms (Babylonians, Euclid, Sieve)
    • Formalization (Godel's and Herbrand's λ-calculus (cf footnote in Church's paper, p. 90 in Undecidable ), Church's theorem (1936) (p. 88ff in Undecidable), Post's "process" (1936) (p. 289ff in Undecidable), Turing's machine (1936-1937) (p. 116ff in Undecidable), J.B. Rosser's definition of "effective method" in terms of "a machine" (1939)(on p. 225-226 in Undecidable), Kleene proposing the "Church-Turing thesis" based on the papers of Church and Turing cited here (1943) (p. 273-274 in Undecidable)
Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Algorithm/to_do&oldid=71504137"