Alonzo Church
Alonzo Church (June 14, 1903 – August 11, 1995) was an American computer scientist, mathematician, logician, and philosopher who made major contributions to mathematical logic and the foundations of theoretical computer science. He is best known for the lambda calculus, the Church–Turing thesis, proving the unsolvability of the ''Entscheidungsproblem'' ("decision problem"), the Frege–Church ontology, and the Church–Rosser theorem. Alongside his doctoral student Alan Turing, Church is considered one of the founders of computer science. Life Alonzo Church was born on June 14, 1903, in Washington, D.C., where his father, Samuel Robbins Church, was a justice of the peace and the judge of the Municipal Court for the District of Columbia. He was the grandson of Alonzo Webster Church (1829–1909), United States Senate Librarian from 1881 to 1901, and great-grandson of Alonzo Church, a professor of Mathematics and Astronomy and 6th President of the University of Ge ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Simon B
Simon may refer to: People * Simon (given name), including a list of people and fictional characters with the given name Simon * Simon (surname), including a list of people with the surname Simon * Eugène Simon, French naturalist and the genus authority ''Simon'' * Tribe of Simeon, one of the twelve tribes of Israel Places * Şimon (), a village in Bran Commune, Braşov County, Romania * Șimon, a right tributary of the river Turcu in Romania Arts, entertainment, and media Films * ''Simon'' (1980 film), starring Alan Arkin * ''Simon'' (2004 film), Dutch drama directed by Eddy Terstall * ''Simón'' (2018 film), Venezuelan short film directed by Diego Vicentini * ''Simón'' (2023 film), Venezuelan feature film directed by Diego Vicentini Games * ''Simon'' (game), a popular computer game * Simon Says, children's game Literature * ''Simon'' (Sutcliff novel), a children's historical novel written by Rosemary Sutcliff * Simon (Sand novel), an 1835 novel by George Sand ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Simply Typed Lambda Calculus
The simply typed lambda calculus (), a form of type theory, is a typed interpretation of the lambda calculus with only one type constructor () that builds function types. It is the canonical and simplest example of a typed lambda calculus. The simply typed lambda calculus was originally introduced by Alonzo Church in 1940 as an attempt to avoid paradoxical use of the untyped lambda calculus. The term ''simple type'' is also used to refer to extensions of the simply typed lambda calculus with constructs such as products, coproducts or natural numbers ( System T) or even full recursion (like PCF). In contrast, systems that introduce polymorphic types (like System F) or dependent types (like the Logical Framework) are not considered ''simply typed''. The simple types, except for full recursion, are still considered ''simple'' because the Church encodings of such structures can be done using only \to and suitable type variables, while polymorphism and dependency cannot. ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Lambda Calculus
In mathematical logic, the lambda calculus (also written as ''λ''-calculus) is a formal system for expressing computability, computation based on function Abstraction (computer science), abstraction and function application, application using variable Name binding, binding and Substitution (algebra), substitution. Untyped lambda calculus, the topic of this article, is a universal machine, a model of computation that can be used to simulate any Turing machine (and vice versa). It was introduced by the mathematician Alonzo Church in the 1930s as part of his research into the foundations of mathematics. In 1936, Church found a formulation which was #History, logically consistent, and documented it in 1940. Lambda calculus consists of constructing #Lambda terms, lambda terms and performing #Reduction, reduction operations on them. A term is defined as any valid lambda calculus expression. In the simplest form of lambda calculus, terms are built using only the following rules: # x: A ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Springer Nature
Springer Nature or the Springer Nature Group is a German-British academic publishing company created by the May 2015 merger of Springer Science+Business Media and Holtzbrinck Publishing Group's Nature Publishing Group, Palgrave Macmillan, and Macmillan Education. History The company originates from several journals and publishing houses, notably Springer-Verlag, which was founded in 1842 by Julius Springer in Berlin (the grandfather of Bernhard Springer who founded Springer Publishing in 1950 in New York), Nature Portfolio, Nature Publishing Group which has published ''Nature (journal) , Nature'' since 1869, and Macmillan Education, which goes back to Macmillan Publishers founded in 1843. Springer Nature was formed in 2015 by the merger of Nature Publishing Group, Palgrave Macmillan, and Macmillan Education (held by Holtzbrinck Publishing Group) with Springer Science+Business Media (held by BC Partners). Plans for the merger were first announced on 15 January 2015. The transactio ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Lecture Notes In Computer Science
''Lecture Notes in Computer Science'' is a series of computer science books published by Springer Science+Business Media since 1973. Overview The series contains proceedings, post-proceedings, monographs, and Festschrifts. In addition, tutorials, state-of-the-art surveys, and "hot topics" are increasingly being included. The series is indexed by DBLP. See also *'' Monographiae Biologicae'', another monograph series published by Springer Science+Business Media *'' Lecture Notes in Physics'' *'' Lecture Notes in Mathematics'' *'' Electronic Workshops in Computing'', published by the British Computer Society image:Maurice Vincent Wilkes 1980 (3).jpg, Sir Maurice Wilkes served as the first President of BCS in 1957. The British Computer Society (BCS), branded BCS, The Chartered Institute for IT, since 2009, is a professional body and a learned ... References External links * Academic journals established in 1973 Computer science books Series of non-fiction books ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Alan Turing
Alan Mathison Turing (; 23 June 1912 – 7 June 1954) was an English mathematician, computer scientist, logician, cryptanalyst, philosopher and theoretical biologist. He was highly influential in the development of theoretical computer science, providing a formalisation of the concepts of algorithm and computation with the Turing machine, which can be considered a model of a general-purpose computer. Turing is widely considered to be the father of theoretical computer science. Born in London, Turing was raised in southern England. He graduated from University of Cambridge, King's College, Cambridge, and in 1938, earned a doctorate degree from Princeton University. During World War II, Turing worked for the Government Code and Cypher School at Bletchley Park, Britain's codebreaking centre that produced Ultra (cryptography), Ultra intelligence. He led Hut 8, the section responsible for German naval cryptanalysis. Turing devised techniques for speeding the breaking of Germ ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Raymond Smullyan
Raymond Merrill Smullyan (; May 25, 1919 – February 6, 2017) was an American mathematician, magician, concert pianist, logician, Taoist, and philosopher. Born in Far Rockaway, New York, Smullyan's first career choice was in stage magic. He earned a BSc from the University of Chicago in 1955 and his PhD from Princeton University in 1959. Smullyan is one of many logicians to have studied with Alonzo Church. Life Smullyan was born on May 25, 1919, in Far Rockaway, Queens, New York, to an Ashkenazi Jewish family. His father was Isidore Smullyan, a Russian-born businessman who emigrated to Belgium when young and graduated from the University of Antwerp, his native language being French. His mother was Rosina Smullyan (née Freeman), a painter and actress born and raised in London. Both parents were musical, his father playing the violin and his mother playing the piano. Smullyan was the youngest of three children. His eldest brother, Emile Benoit Smullyan, later became an econ ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Norman Shapiro
Norman Zalmon Shapiro was an American mathematician, who was the co-author of the Rice–Shapiro theorem. Education Shapiro obtained a BS in mathematics at University of Illinois in 1952. Shapiro spent the summer of 1954 at Bell Laboratories in Murray Hill, New Jersey where, in collaboration with Karel de Leeuw, Ed Moore, and Claude Shannon, he investigated the question of whether providing a Turing machine augmented with an oracle machine producing an infinite sequence of random events (like the tosses of a fair coin) would enable the machine to output a non-computable sequence. The well-known efficacy of Monte Carlo methods might have led one to think otherwise, but the result was negative. Stated precisely: : An infinite string, S, on a finite alphabet is computable if it can be output with probability one by a Turing machine augmented by an oracle machine giving an infinite sequence of equal-probability zeroes and ones. Moreover, the result continues to hold if the outpu ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Dana Scott
Dana Stewart Scott (born October 11, 1932) is an American logician who is the emeritus Hillman University Professor of Computer Science, Philosophy, and Mathematical Logic at Carnegie Mellon University; he is now retired and lives in Berkeley, California. His work on automata theory earned him the Turing Award in 1976, while his collaborative work with Christopher Strachey in the 1970s laid the foundations of modern approaches to the semantics of programming languages. He has also worked on modal logic, topology, and category theory. Early career He received his B.A. in Mathematics from the University of California, Berkeley, in 1954. He wrote his Ph.D. thesis on ''Convergent Sequences of Complete Theories'' under the supervision of Alonzo Church while at Princeton, and defended his thesis in 1958. Solomon Feferman (2005) writes of this period: After completing his Ph.D. studies, he moved to the University of Chicago, working as an instructor there until 1960. In 1959, h ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Hartley Rogers, Jr
Hartley Rogers Jr. (July 6, 1926 – July 17, 2015) was an American mathematician who worked in computability theory, and was a professor in the Mathematics Department of the Massachusetts Institute of Technology. Biography Born in 1926 in Buffalo, New York, Rogers studied English as an undergraduate at Yale University, graduating in 1946. After visiting the University of Cambridge under a Henry Fellowship, he returned to Yale for a master's degree in physics, which he completed in 1950. He studied mathematics under Alonzo Church at Princeton, earned a second master's degree in 1951, and received his Ph.D. there in 1952. He was a Benjamin Peirce Lecturer at Harvard University from 1952 to 1955. After holding a visiting position at MIT, he became a professor in the MIT Mathematics Department in 1956. His doctoral students included Patrick Fischer, Louis Hodes, Carl Jockusch, Andrew Kahr, David Luckham, Rohit Parikh, David Park, and John Stillwell. He chaired the MIT faculty ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Nicholas Rescher
Nicholas Rescher (; ; 15 July 1928 – 5 January 2024) was a German-born American philosopher, polymath, and author, who was a professor of philosophy at the University of Pittsburgh from 1961. He was chairman of the Center for Philosophy of Science and chairman of the philosophy department. Rescher served as president of the American Catholic Philosophical Association, Leibniz Society of North America, American Metaphysical Society, American Philosophical Association, and Charles S. Peirce Society. He was the founder of '' American Philosophical Quarterly'', '' History of Philosophy Quarterly'', and '' Public Affairs Quarterly''. He died in Pittsburgh on January 5, 2024, at the age of 95. Early life and education Rescher was born in Hagen in the Westphalia region of Germany. In his autobiography he traces his descent to Nehemias Rescher (1735–1801), a founder of the Hochberg-Remseck Jewish community in Swabian Germany. He relocated to the United States when he was 10 an ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |