[permalink] [id link]
* Alonzo Church, A Bibliography of Symbolic Logic, 1666 – 1935 ( ISBN 978-0-8218-0084-3 )
from
Wikipedia
Some Related Sentences
Alonzo and Church
* American mathematician Alonzo Church created a method for defining functions called the λ-calculus,
At the University of Göttingen, Hilbert was surrounded by a social circle of some of the most important mathematicians of the 20th century, such as Emmy Noether and Alonzo Church.
The basis for later theoretical computer science, in Alonzo Church and Alan Turing also grew directly out of this ' debate '.
In 1936 and 1937, Alonzo Church and Alan Turing, respectively, published independent papers showing that a general solution to the Entscheidungsproblem is impossible.
This was done by Alonzo Church in 1936 with the concept of " effective calculability " based on his λ calculus and by Alan Turing in the same year with his concept of Turing machines.
The negative answer to the was then given by Alonzo Church in 1935 – 36 and independently shortly thereafter by Alan Turing in 1936 – 37.
* Alonzo Church, " An unsolvable problem of elementary number theory ", American Journal of Mathematics, 58 ( 1936 ), pp 345 – 363
* Alonzo Church, " A note on the Entscheidungsproblem ", Journal of Symbolic Logic, 1 ( 1936 ), pp 40 – 41.
The name refers to the lambda calculus, a mathematical formalism invented by Alonzo Church, with which LISP is intimately connected, and references the Knights Templar.
The use of mathematical logic to represent and execute computer programs is also a feature of the lambda calculus, developed by Alonzo Church in the 1930s.
It was first formulated by Alonzo Church as a way to formalize mathematics through the notion of functions, in contrast to the field of set theory.
The lambda calculus was introduced by mathematician Alonzo Church in the 1930s as part of an investigation into the foundations of mathematics.
Some notable mathematicians include Archimedes of Syracuse, Leonhard Euler, Carl Gauss, Johann Bernoulli, Jacob Bernoulli, Aryabhata, Brahmagupta, Bhaskara II, Nilakantha Somayaji, Omar Khayyám, Muhammad ibn Mūsā al-Khwārizmī, Bernhard Riemann, Gottfried Leibniz, Andrey Kolmogorov, Euclid of Alexandria, Jules Henri Poincaré, Srinivasa Ramanujan, Alexander Grothendieck, David Hilbert, Alan Turing, von Neumann, Kurt Gödel, Joseph-Louis Lagrange, Georg Cantor, William Rowan Hamilton, Carl Jacobi, Évariste Galois, Nikolay Lobachevsky, Rene Descartes, Joseph Fourier, Pierre-Simon Laplace, Alonzo Church, Nikolay Bogolyubov and Pierre de Fermat.
Newman subsequently arranged for Turing to visit Princeton where Alonzo Church was working on the same problem but using his Lambda calculus.
Alonzo Church mentions this notation in his classic book on mathematical logic as worthy of remark in notational systems even contrasted to Whitehead and Russell's logical notational exposition and work in Principia Mathematica.
One of many distinguished students of Alonzo Church, Kleene, along with Alan Turing, Emil Post, and others, is best known as a founder of the branch of mathematical logic known as recursion theory.
Some pioneers of the theory of computation were Alonzo Church, Alan Turing, Stephen Kleene, John von Neumann and Claude Shannon.
A more mathematically oriented definition with a similar " universal " nature was introduced by Alonzo Church, whose work on lambda calculus intertwined with Turing's in a formal theory of computation known as the Church – Turing thesis.
* W. W. Boone and H. Rogers Jr., " On a problem of J. H. C. Whitehead and a problem of Alonzo Church ", Math.
Alonzo Church, inventor of the lambda calculus, developed a higher-order logic commonly called Church's Theory of Types, in order to avoid the Kleene – Rosser paradox afflicting the original pure lambda calculus.
The power and scope of combinatory logic is quite similar to that of the lambda calculus of Alonzo Church, and the latter formalism has tended to predominate in recent decades.
Von Mises never totally formalized his definition of a proper selection rule for sub-sequences, but in 1940 Alonzo Church defined it as any recursive function which having read the first N elements of the sequence decides if it wants to select element number N + 1.
Alonzo and Symbolic
Alonzo and Logic
* C. Anthony Anderson and Michael Zelëny, editors, Logic, Meaning and Computation: Essays in Memory of Alonzo Church ( ISBN 978-1-4020-0141-3 )
Alonzo and –
Subsequent formalizations were framed as attempts to define " effective calculability " or " effective method "; those formalizations included the Gödel – Herbrand – Kleene recursive functions of 1930, 1934 and 1935, Alonzo Church's lambda calculus of 1936, Emil Post's " Formulation 1 " of 1936, and Alan Turing's Turing machines of 1936 – 7 and 1939.
After a few presidents of the Provisional Junta, there were again consuls of the republic, 14 March 1841 – 13 March 1844 ( ruling jointly, but occasionally styled " first consul ", " second consul "): Carlos Antonio López Ynsfrán ( b. 1792 – d. 1862 ) + Mariano Roque Alonzo Romero ( d. 1853 ) ( the lasts of the aforementioned juntistas, Commandant-General of the Army )
* October 24 – The earliest United States patent for a phosphorus friction match is granted to Alonzo Dwight Phillips of Springfield, Massachusetts.
Alonzo Church ( June 14, 1903 – August 11, 1995 ) was an American mathematician and logician who made major contributions to mathematical logic and the foundations of theoretical computer science.
* Princeton University Library, Manuscripts Division, The Alonzo Church Papers, 1924 – 1995: finding aid.
On Friday, May 19, 1690, two days before the Sunday of the Holy Trinity, Alonzo de Leon arrived at this river and following the custom of the Spanish explorers of the day, named the river after this religious Holy Day – “ Rio de la Santissima Trinidad ” or the River of the most Holy Trinity .”
Bickley's Grocery, owned and operated by Cecil Alonzo Bickley ( 1912 – 2004 ) and his wife, Peggy Patterson Bickley ( 1913 – 2007 ), was a popular business in Denver City from 1939 until the couple retired in 1974.
0.162 seconds.