 |
|
|
Alonzo Church | A Wisdom Archive on Alonzo Church | | Alonzo Church A selection of articles related to Alonzo Church | |
| |
Alonzo Church
| | | Page 1 » Page 2 « Page 3 More » | |
| |
| ARTICLES RELATED TO Alonzo Church | | | |  Alonzo Church: Encyclopedia II - National Autonomous University of Mexico - Famous alumniMany of the most prominent figures in the economical, political, scientific and artistic life in Mexico have been either UNAM alumni of faculty:
National Autonomous University of Mexico - Presidents.
Carlos Salinas de Gortari (President of Mexico 1988–1994)
Miguel de la Madrid Hurtado (President of Mexico 1982–1988)
José López Portillo y Pacheco (President of Mexico 1976–1982)
Luis Echeverría Álvarez (President of Mexico 1970–1976)
Miguel Alemán Valdé ...
See also:National Autonomous University of Mexico, National Autonomous University of Mexico - History, National Autonomous University of Mexico - Undergraduate studies, National Autonomous University of Mexico - List of Faculties, National Autonomous University of Mexico - Graduate studies, National Autonomous University of Mexico - Research, National Autonomous University of Mexico - University City, National Autonomous University of Mexico - External buildings of interest, National Autonomous University of Mexico - Palacio de Minería, National Autonomous University of Mexico - Casa del Lago, National Autonomous University of Mexico - Museo de San Ildefonso, National Autonomous University of Mexico - Museo Universitario del Chopo, National Autonomous University of Mexico - Observatorio Astronómico Nacional, National Autonomous University of Mexico - Political Climate, National Autonomous University of Mexico - Football team, National Autonomous University of Mexico - University Ranking, National Autonomous University of Mexico - Famous alumni, National Autonomous University of Mexico - Presidents, National Autonomous University of Mexico - Politicians, National Autonomous University of Mexico - Scientists, National Autonomous University of Mexico - Writers and humanists, National Autonomous University of Mexico - Tycoons, National Autonomous University of Mexico - External link Read more here: » National Autonomous University of Mexico: Encyclopedia II - National Autonomous University of Mexico - Famous alumni |
| |
| | | | | Alonzo Church: Encyclopedia II - Nathan Salmon - Biography Salmon was born January 2, 1951 in Los Angeles. His parents, Rebecca Ucuzoglu (ne'e Rebecca Sene) and Mario Ucuzoglu (ne'e Mair Salmon), were Sephardi Jews of Spanish-Turkish heritage. Salmon is grandson of archivist Emily Sene (ne'e Emily Perez) and oud player Isaac Sene, whose bodies of work have been described by ethnomusicologist Edwin Seroussi and are held in the University of California, Los Angeles (UCLA) Ethnomusicology Archive. Salmon attended Lincoln School, North High School, and El Camino College, in Torrance, California, and UCL ...
See also:Nathan Salmon, Nathan Salmon - Biography, Nathan Salmon - Work, Nathan Salmon - Books, Nathan Salmon - Selected Articles Read more here: » Nathan Salmon: Encyclopedia II - Nathan Salmon - Biography |
| |
| | | | | Alonzo Church: Encyclopedia II - List of eponyms - L - Z See List of eponyms (L-Z)
An asterisk designates people who became eponyms despite their stated wishes not to.
...
See also:List of eponyms, List of eponyms - A, List of eponyms - B, List of eponyms - C, List of eponyms - D, List of eponyms - E, List of eponyms - F, List of eponyms - G, List of eponyms - H, List of eponyms - I - J, List of eponyms - K, List of eponyms - L - Z Read more here: » List of eponyms: Encyclopedia II - List of eponyms - L - Z |
| |
| | | | | Alonzo Church: Encyclopedia II - Lisp programming language - Syntax and semantics Lisp is an expression-oriented language. Unlike most other languages, no distinction is made between "expressions" and "statements"; all code and data are written as expressions. When an expression is evaluated, it produces a value (or list of values), which then can be embedded into other expressions.
McCarthy's 1958 paper introduced two types of syntax: S-expressions (Symbolic Expressions, also called "sexps"), which mirror the internal representation of code and data ...
See also:Lisp programming language, Lisp programming language - The invention of Lisp: 1958-1962, Lisp programming language - Curiosities of the early history, Lisp programming language - Lisp and AI, Lisp programming language - Lisp today, Lisp programming language - Language innovations, Lisp programming language - Syntax and semantics, Lisp programming language - Lambda expressions, Lisp programming language - Conses and lists, Lisp programming language - Self-evaluating forms and quoting, Lisp programming language - Scope and closure, Lisp programming language - List structure of program code, Lisp programming language - Evaluation and the Read-Eval-Print Loop, Lisp programming language - Control structures, Lisp programming language - Examples, Lisp programming language - Object systems, Lisp programming language - Genealogy and variants, Lisp programming language - Major modern dialects, Lisp programming language - Historically significant dialects, Lisp programming language - Minor dialects, Lisp programming language - Miscellaneous implementations, Lisp programming language - Related languages, Lisp programming language - Quotations Read more here: » Lisp programming language: Encyclopedia II - Lisp programming language - Syntax and semantics |
| |
| | | | | Alonzo Church: Encyclopedia II - Plato - Bibliography Plato's writings (most of them dialogues) have been published in several fashions; this has led to several conventions regarding the naming and referencing of Plato's texts.
Plato - By tetralogy.
One tradition regarding the arrangement of Plato's texts is according to tetralogies. This scheme is ascribed by Diogenes Laertius to an ancient scholar and court astrologer to Tiberius named Thrasyllus.
In the list below, works by Plato are marked (1) if there is no consensus among scholars as to whether P ...
See also:Plato, Plato - Biography, Plato - Work, Plato - Themes, Plato - Form and basis, Plato - Metaphysics, Plato - Epistemology, Plato - The state, Plato - Platonic scholarship, Plato - Bibliography, Plato - By tetralogy, Plato - Stephanus pagination, Plato - Chronology, Plato - Middle Dialogues, Plato - Loeb Classical Library Read more here: » Plato: Encyclopedia II - Plato - Bibliography |
| |
| | | | | | | | | | Alonzo Church: Encyclopedia II - John von Neumann - Biography "We can all think clearly, more or less, some of the time, but von Neumann's clarity of thought was orders of magnitude greater than that of most of us, all the time. For von Neumann it seemed to be impossible to be unclear in thought or in expression." --Paul Halmos
The oldest of three children, von Neumann was born Neumann Margittai János Lajos (two surnames, two given names respectively) in Budapest, Austria-Hungary (Osztrák-Magyar Monarchia) to Neumann Miksa (Max Neumann), a lawyer who worked in a bank, and ...
See also:John von Neumann, John von Neumann - Biography, John von Neumann - Logic, John von Neumann - Quantum mechanics, John von Neumann - Economics, John von Neumann - Armaments, John von Neumann - Computer science, John von Neumann - Politics and social affairs, John von Neumann - Honors, John von Neumann - Students Read more here: » John von Neumann: Encyclopedia II - John von Neumann - Biography |
| |
| | | | | | | Alonzo Church: Encyclopedia II - Actor model - Message Passing Semantics The Actor model is about the semantics of message passing.
Actor model - The unbounded nondeterminism controversy.
Arguably, the first concurrent programs were interrupt handlers. During the course of its normal operation, a computer needed to be able to receive information from outside (characters from a keyboard, packets from a network, etc.). So when the information arrived execution of the computer was "interrupted" and special code called an interrupt handler was called to put the information in a b ...
See also:Actor model, Actor model - History, Actor model - Fundamental concepts, Actor model - Formal systems, Actor model - Applications, Actor model - Models prior to the Actor model, Actor model - Lambda calculus, Actor model - Simula, Actor model - Smalltalk, Actor model - Petri nets, Actor model - Message Passing Semantics, Actor model - The unbounded nondeterminism controversy, Actor model - Direct communication and asynchrony, Actor model - Actor creation plus addresses in messages means variable topology, Actor model - Inherently concurrent, Actor model - No requirement on order of message arrival, Actor model - Not sequentiality not buffering not synchrony and not fixed topology, Actor model - Locality, Actor model - Compositionality, Actor model - Behaviors, Actor model - Relationship to mathematical logic, Actor model - Migration, Actor model - Security, Actor model - Synthesizing addresses of Actors, Actor model - Why is the Actor model important now?, Actor model - Actor researchers Read more here: » Actor model: Encyclopedia II - Actor model - Message Passing Semantics |
| |
| | | | | Alonzo Church: Encyclopedia II - Algorithm - Classes There are many ways to classify algorithms, and the merits of each classification have been the subject of ongoing debate.
Algorithm - Classification by implementation.
One way to classify algorithms is by implementation means.
Recursion or iteration: A recursive algorithm is one that invokes (makes reference to) itself repeatedly until a certain condition matches, which is a method common to functional programming. Iterative algorithms use repetitive constructs like loops and so ...
See also:Algorithm, Algorithm - History, Algorithm - Formalization of algorithms, Algorithm - Implementation, Algorithm - Example, Algorithm - Classes, Algorithm - Classification by implementation, Algorithm - Classification by design paradigm, Algorithm - Classification by field of study, Algorithm - Classification by complexity, Algorithm - Legal issues Read more here: » Algorithm: Encyclopedia II - Algorithm - Classes |
| |
| | | | | Alonzo Church: Encyclopedia II - Algorithm - Classes There are many ways to classify algorithms, and the merits of each classification have been the subject of ongoing debate.
Algorithm - Classification by implementation.
One way to classify algorithms is by implementation means.
Recursion or iteration: A recursive algorithm is one that invokes (makes reference to) itself repeatedly until a certain condition matches, which is a method common to functional programming. Iterative algorithms use repetitive constructs like loops and so ...
See also:Algorithm, Algorithm - History, Algorithm - Formalization of algorithms, Algorithm - Implementation, Algorithm - Example, Algorithm - Algorithm analysis, Algorithm - Classes, Algorithm - Classification by implementation, Algorithm - Classification by design paradigm, Algorithm - Classification by field of study, Algorithm - Classification by complexity, Algorithm - Legal issues Read more here: » Algorithm: Encyclopedia II - Algorithm - Classes |
| |
| | | | | Alonzo Church: Encyclopedia II - Computer science - Theory and practice Many universities teach computer science as a theoretical study of computation and algorithmic reasoning. These programs often feature the theory of computation, analysis of algorithms, formal methods, concurrency control, databases, computer graphics and systems analysis, among others. They typically also teach computer programming, but treat it as a vessel for the support of other fields of computer ...
See also:Computer science, Computer science - History, Computer science - Theory and practice, Computer science - Careers Read more here: » Computer science: Encyclopedia II - Computer science - Theory and practice |
| |
| | | | | Alonzo Church: Encyclopedia II - Computer science - Fields of computer science
Computer science - Mathematical foundations.
Cryptography
algorithms for protecting private data, including encryption
Graph theory
Mathematical logic
Type Theory
formal analysis of the types of data, and the use of these types to understand properties of programs, especially program safety
Computer science - Theory of computation.
Automata theory
Computability theory
Computational complexity theory
fundamen ...
See also:Computer science, Computer science - History, Computer science - Theory and practice, Computer science - Relationship with software engineering, Computer science - Fields of computer science, Computer science - Mathematical foundations, Computer science - Theory of computation, Computer science - Design and analysis of algorithms and data structures, Computer science - Programming languages and compilers, Computer science - Software development, Computer science - Databases, Computer science - Concurrency and distributed systems, Computer science - Artificial intelligence, Computer science - Computer graphics, Computer science - Scientific computing, Computer science - Careers, Computer science - Notes Read more here: » Computer science: Encyclopedia II - Computer science - Fields of computer science |
| |
| | | | | Alonzo Church: Encyclopedia II - Functional programming - Pure functions Purely functional programs have no side-effects. Since functions do not modify state, no data may be changed by parallel function calls. For this reason, pure functions are always thread-safe, a fact which is exploited by languages that use call-by-future evaluation. Because ordering of side-effects does not have to be preserved in their absence, some languages (such as Haskell) use call-by-need evaluation for pure functions.
"Pure" functional programming languages typically enforce referential transparency, which is the notion ...
See also:Functional programming, Functional programming - History, Functional programming - Higher-order functions, Functional programming - Comparison with imperative programming, Functional programming - Pure functions, Functional programming - Monads, Functional programming - Expansion of functional programming, Functional programming - Speed and space considerations, Functional programming - Functional languages Read more here: » Functional programming: Encyclopedia II - Functional programming - Pure functions |
| |
| | | | | Alonzo Church: Encyclopedia II - Dana Scott - Oxford University 1972–1981 Dana Scott took up a post as Professor of Mathematical Logic, in the Philosophy Faculty of Oxford University in 1972.
Dana Scott - Semantics of programming languages.
This period saw Scott working close to Christopher Strachey, and the two managed, despite intense administrative pressures, to oversee a great deal of fundamental work on providing a mathematical foundation for the semantics of programming languages, the work for which Scott is best known. Together their work constitutes the Scott-Strachey ap ...
See also:Dana Scott, Dana Scott - Early career, Dana Scott - University of California Berkeley 1960–1963, Dana Scott - Stanford Amsterdam and Princeton 1963–1972, Dana Scott - Oxford University 1972–1981, Dana Scott - Semantics of programming languages, Dana Scott - Carnegie Mellon University 1981–2003 Read more here: » Dana Scott: Encyclopedia II - Dana Scott - Oxford University 1972–1981 |
| |
| | | | | Alonzo Church: Encyclopedia II - Computer science - Fields of computer science
Computer science - Mathematical foundations.
Cryptography
algorithms for protecting private data, including encryption
Graph theory
Mathematical logic
Type Theory
formal analysis of the types of data, and the use of these types to understand properties of programs, especially program safety
Computer science - Theory of computation.
Automata theory
Computability theory
Computational complexity theory
fundamen ...
See also:Computer science, Computer science - History, Computer science - Computer science education, Computer science - Relationship with other fields, Computer science - Fields of computer science, Computer science - Mathematical foundations, Computer science - Theory of computation, Computer science - Design and analysis of algorithms and data structures, Computer science - Programming languages and compilers, Computer science - Software development, Computer science - Databases, Computer science - Concurrency and distributed systems, Computer science - Artificial intelligence, Computer science - Computer graphics, Computer science - Scientific computing, Computer science - Careers, Computer science - Notes Read more here: » Computer science: Encyclopedia II - Computer science - Fields of computer science |
| |
| | | Page 1 » Page 2 « Page 3 More » | |
| |
|
|
