Algoritmo

Ha matematika, pagihap, lingwistika, an **algoritmo** amo an surundan nga naghahatag hin solusyon ha usa ka problema nga agsob gamiton ha pagkalkula ngan pag proseso hin mga datos.

## Pinanbasaran

## Mga reperensya

* Axt, P. (1959) On a Subrecursive Hierarchy and Primitive Recursive Degrees, *Transactions of the American Mathematical Society* 92, pp.&nbsp;85–105
* Bell, C. Gordon and Newell, Allen (1971), *Computer Structures: Readings and Examples*, McGraw-Hill Book Company, New York. ISBN 0-07-004357-4.
* 
*  Includes an excellent bibliography of 56 references.
* : cf. Chapter 3 *Turing machines* where they discuss "certain enumerable sets not effectively (mechanically) enumerable".
* 
* Campagnolo, M.L., Moore, C., and Costa, J.F. (2000) An analog characterization of the subrecursive functions. In *Proc. of the 4th Conference on Real Numbers and Computers*, Odense University, pp.&nbsp;91–109
*  Reprinted in *The Undecidable*, p.&nbsp;89ff. The first expression of "Church's Thesis". See in particular page 100 (*The Undecidable*) where he defines the notion of "effective calculability" in terms of "an algorithm", and he uses the word "terminates", etc.
*   Reprinted in *The Undecidable*, p.&nbsp;110ff. Church shows that the Entscheidungsproblem is unsolvable in about 3 pages of text and 3 pages of footnotes.
* 
*  Davis gives commentary before each article. Papers of Gödel, Alonzo Church, Turing, Rosser, Kleene, and Emil Post are included; those cited in the article are listed here by author's name.
*  Davis offers concise biographies of Leibniz, Boole, Frege, Cantor, Hilbert, Gödel and Turing with von Neumann as the show-stealing villain. Very brief bios of Joseph-Marie Jacquard, Babbage, Ada Lovelace, Claude Shannon, Howard Aiken, etc.
* 
* 
* 
* Yuri Gurevich, ''Sequential Abstract State Machines Capture Sequential Algorithms'', ACM Transactions on Computational Logic, Vol 1, no 1 (July 2000), pages 77–111. Includes bibliography of 33 sources.
* 
*  Presented to the American Mathematical Society, September 1935. Reprinted in *The Undecidable*, p.&nbsp;237ff. Kleene's definition of "general recursion" (known now as mu-recursion) was used by Church in his 1935 paper *An Unsolvable Problem of Elementary Number Theory* that proved the "decision problem" to be "undecidable" (i.e., a negative result).
*  Reprinted in *The Undecidable*, p.&nbsp;255ff. Kleene refined his definition of "general recursion" and proceeded in his chapter "12. Algorithmic theories" to posit "Thesis I" (p.&nbsp;274); he would later repeat this thesis (in Kleene 1952:300) and name it "Church's Thesis"(Kleene 1952:317) (i.e., the Church thesis).
*  Excellent—accessible, readable—reference source for mathematical "foundations".
* 
* 
* Kosovsky, N. K. *Elements of Mathematical Logic and its Application to the theory of Subrecursive Algorithms*, LSU Publ., Leningrad, 1981
* 
* A. A. Markov (1954) *Theory of algorithms*. [Translated by Jacques J. Schorr-Kon and PST staff] Imprint Moscow, Academy of Sciences of the USSR, 1954 [i.e., Jerusalem, Israel Program for Scientific Translations, 1961; available from the Office of Technical Services, U.S. Dept. of Commerce, Washington] Description 444 p.&nbsp;28&nbsp;cm. Added t.p. in Russian Translation of Works of the Mathematical Institute, Academy of Sciences of the USSR, v. 42. Original title: Teoriya algerifmov. [QA248.M2943 Dartmouth College library. U.S. Dept. of Commerce, Office of Technical Services, number OTS 60-51085.]
*  Minsky expands his "...idea of an algorithm—an effective procedure..." in chapter 5.1 *Computability, Effective Procedures and Algorithms. Infinite machines.*
*  Reprinted in *The Undecidable*, p.&nbsp;289ff. Post defines a simple algorithmic-like process of a man writing marks or erasing marks and going from box to box and eventually halting, as he follows a list of simple instructions. This is cited by Kleene as one source of his "Thesis I", the so-called Church–Turing thesis.
* 
*  Reprinted in *The Undecidable*, p.&nbsp;223ff. Herein is Rosser's famous definition of "effective method": "...a method each step of which is precisely predetermined and which is certain to produce the answer in a finite number of steps... a machine which will then solve any problem of the set with no human intervention beyond inserting the question and (later) reading the answer" (p.&nbsp;225–226, *The Undecidable*)
*  
* 
* 
* 
*  Cf. in particular the first chapter titled: *Algorithms, Turing Machines, and Programs*. His succinct informal definition: "...any sequence of instructions that can be obeyed by a robot, is called an *algorithm*" (p.&nbsp;4).
* 
* . Corrections, ibid, vol. 43(1937) pp.&nbsp;544–546. Reprinted in *The Undecidable*, p.&nbsp;116ff. Turing's famous paper completed as a Master's dissertation while at King's College Cambridge UK.
*  Reprinted in *The Undecidable*, p.&nbsp;155ff. Turing's paper that defined "the oracle" was his PhD thesis while at Princeton USA.
* 
* United States Patent and Trademark Office (2006), ''2106.02 **>Mathematical Algorithms: 2100 Patentability'', Manual of Patent Examining Procedure (MPEP). Latest revision August 2006

### Mga segundarya nga reperensya
* , ISBN 0-8078-4108-0 pbk.
* , ISBN 0-312-10409-X (pbk.)
* , 3rd edition 1976[?], ISBN 0-674-32449-8 (pbk.)
* , ISBN 0-671-49207-1. Cf. Chapter "The Spirit of Truth" for a history leading to, and a discussion of, his proof.

## Padugang nga barasahon

* 
* 
* Knuth, Donald E. (2000). *[http://www-cs-faculty.stanford.edu/~uno/aa.html Selected Papers on Analysis of Algorithms] *. Stanford, California: Center for the Study of Language and Information.
* Knuth, Donald E. (2010). *[http://www-cs-faculty.stanford.edu/~uno/da.html Selected Papers on Design of Algorithms] *. Stanford, California: Center for the Study of Language and Information.
* 
* 

## Mga sumpay ha gawas

* 
* 
* 
* Dictionary of Algorithms and Data Structures—National Institute of Standards and Technology
* Algorithms and Data Structures by Dr Nikolai Bezroukov
; Mga repositoryo han Algorithmo
* The Stony Brook Algorithm Repository—State University of New York at Stony Brook
* Netlib Repository—University of Tennessee and Oak Ridge National Laboratory
* Collected Algorithms of the ACM—Association for Computing Machinery
* The Stanford GraphBase —Stanford University
* Combinatorica—University of Iowa and State University of New York at Stony Brook
* Library of Efficient Datastructures and Algorithms (LEDA)—previously from Max-Planck-Institut für Informatik
* Archive of Interesting Code
* A semantic wiki to collect, categorize and relate all algorithms and data structures 
; Lecture notes
* Algorithms Course Materials . Jeff Erickson. University of Illinois.
; Community
* Algorithms on Google+