Faster access than browser!
88 relations: Abstract machine, Ackermann function, Alan Turing, Alexander S. Kechris, Algorithm, Alonzo Church, Andreas Blass, Andrey Markov, Boolean algebra, C preprocessor, Cantor, Cantor's diagonal argument, Chinese room, Chomsky hierarchy, Christos Papadimitriou, Church–Turing thesis, Computable function, Computational theory of mind, Computer, Constructivism (mathematics), Counter machine, Counter-machine model, Daniel Dennett, Darwin's Dangerous Idea, Data flow diagram, David Berlinski, Decision tree, Diagonal method, Donald Knuth, Emil Leon Post, Enumeration, Euclidean algorithm, Formal grammar, Formal language, Formal system, George Boolos, Greatest common divisor, Harry R. Lewis, Hartley Rogers Jr., Hierarchy, Howard Jerome Keisler, Ian Stewart (mathematician), Intrinsic and extrinsic properties, Intuitionism, J. Barkley Rosser, Jan van Leeuwen, John P. Burgess, John Searle, John Venn, Jon Barwise, ..., Kenneth Kunen, Kurt Gödel, Lambda calculus, Logical form, M4 (computer language), Machine code, Martin Davis, Michael Sipser, Mind, MIX, Natural number, Peter van Emde Boas, Pointer machine, Post–Turing machine, Primitive recursive function, Programming language, Random-access machine, Random-access stored-program machine, Rózsa Péter, Recursion, Register machine, Richard Jeffrey, Robert I. Soare, Robin Gandy, Semantics, State diagram, Stephen Cole Kleene, Syllogism, Syntax, Taxonomy (general), Tetration, Turing completeness, Turing machine, Turing machine equivalents, Universal Turing machine, Wilhelm Ackermann, William Stanley Jevons, Yuri Gurevich. Expand index (38 more) »
Abstract machine
An abstract machine, also called an abstract computer, is a theoretical model of a computer hardware or software system used in automata theory.
New!!: Algorithm characterizations and Abstract machine · See more »
Ackermann function
In computability theory, the Ackermann function, named after Wilhelm Ackermann, is one of the simplest and earliest-discovered examples of a total computable function that is not primitive recursive.
New!!: Algorithm characterizations and Ackermann function · See more »
Alan Turing
Alan Mathison Turing (23 June 1912 – 7 June 1954) was an English computer scientist, mathematician, logician, cryptanalyst, philosopher, and theoretical biologist.
New!!: Algorithm characterizations and Alan Turing · See more »
Alexander S. Kechris
Alexander Sotirios Kechris (Αλέξανδρος Σωτήριος Κεχρής; born March 23, 1946) is a set theorist and logician at California Institute of Technology.
New!!: Algorithm characterizations and Alexander S. Kechris · See more »
Algorithm
In mathematics and computer science, an algorithm is an unambiguous specification of how to solve a class of problems.
New!!: Algorithm characterizations and Algorithm · See more »
Alonzo Church
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.
New!!: Algorithm characterizations and Alonzo Church · See more »
Andreas Blass
Andreas Raphael Blass (born October 27, 1947 in Nuremberg) is a mathematician, currently a professor at the University of Michigan.
New!!: Algorithm characterizations and Andreas Blass · See more »
Andrey Markov
Andrey (Andrei) Andreyevich Markov (Андре́й Андре́евич Ма́рков, in older works also spelled Markoff) (14 June 1856 N.S. – 20 July 1922) was a Russian mathematician.
New!!: Algorithm characterizations and Andrey Markov · See more »
Boolean algebra
In mathematics and mathematical logic, Boolean algebra is the branch of algebra in which the values of the variables are the truth values true and false, usually denoted 1 and 0 respectively.
New!!: Algorithm characterizations and Boolean algebra · See more »
C preprocessor
The C preprocessor or cpp is the macro preprocessor for the C and C++ computer programming languages.
New!!: Algorithm characterizations and C preprocessor · See more »
Cantor
A cantor is a person who leads people in singing, or sometimes in prayer.
New!!: Algorithm characterizations and Cantor · See more »
Cantor's diagonal argument
In set theory, Cantor's diagonal argument, also called the diagonalisation argument, the diagonal slash argument or the diagonal method, was published in 1891 by Georg Cantor as a mathematical proof that there are infinite sets which cannot be put into one-to-one correspondence with the infinite set of natural numbers.
New!!: Algorithm characterizations and Cantor's diagonal argument · See more »
Chinese room
The Chinese room argument holds that a program cannot give a computer a "mind", "understanding" or "consciousness", regardless of how intelligently or human-like the program may make the computer behave.
New!!: Algorithm characterizations and Chinese room · See more »
Chomsky hierarchy
In the formal languages of computer science and linguistics, the Chomsky hierarchy (occasionally referred to as Chomsky–Schützenberger hierarchy) is a containment hierarchy of classes of formal grammars.
New!!: Algorithm characterizations and Chomsky hierarchy · See more »
Christos Papadimitriou
Christos Harilaos Papadimitriou (Greek: Χρήστος Χαρίλαος Παπαδημητρίου; born August 16, 1949) is a Greek theoretical computer scientist, and professor of Computer Science at Columbia University.
New!!: Algorithm characterizations and Christos Papadimitriou · See more »
Church–Turing thesis
In computability theory, the Church–Turing thesis (also known as computability thesis, the Turing–Church thesis, the Church–Turing conjecture, Church's thesis, Church's conjecture, and Turing's thesis) is a hypothesis about the nature of computable functions.
New!!: Algorithm characterizations and Church–Turing thesis · See more »
Computable function
Computable functions are the basic objects of study in computability theory.
New!!: Algorithm characterizations and Computable function · See more »
Computational theory of mind
In philosophy, the computational theory of mind (CTM) refers to a family of views that hold that the human mind is an information processing system and that cognition and consciousness together are a form of computation.
New!!: Algorithm characterizations and Computational theory of mind · See more »
Computer
A computer is a device that can be instructed to carry out sequences of arithmetic or logical operations automatically via computer programming.
New!!: Algorithm characterizations and Computer · See more »
Constructivism (mathematics)
In the philosophy of mathematics, constructivism asserts that it is necessary to find (or "construct") a mathematical object to prove that it exists.
New!!: Algorithm characterizations and Constructivism (mathematics) · See more »
Counter machine
A counter machine is an abstract machine used in formal logic and theoretical computer science to model computation.
New!!: Algorithm characterizations and Counter machine · See more »
Counter-machine model
This page supplements counter machine. Although some authors use the name "register machine" synonymously with "counter machine", this article will give details and examples of only of the most primitive speciesthe "counter machine"of the genus "register machine." Within the species "counter machine" there are a number of varieties: the models of Hermes (1954), Kaphengst (1957), Ershov (1958), Péter (1958), Minsky (1961) and Minsky (1967), Melzak (1961), Lambek (1961), Shepherdson and Sturgis (1963), and Schönhage (1980).
New!!: Algorithm characterizations and Counter-machine model · See more »
Daniel Dennett
Daniel Clement Dennett III (born March 28, 1942) is an American philosopher, writer, and cognitive scientist whose research centers on the philosophy of mind, philosophy of science, and philosophy of biology, particularly as those fields relate to evolutionary biology and cognitive science.
New!!: Algorithm characterizations and Daniel Dennett · See more »
Darwin's Dangerous Idea
Darwin's Dangerous Idea: Evolution and the Meanings of Life is a 1995 book by Daniel Dennett, in which the author looks at some of the repercussions of Darwinian theory.
New!!: Algorithm characterizations and Darwin's Dangerous Idea · See more »
Data flow diagram
A data flow diagram (DFD) is a graphical representation of the "flow" of data through an information system, modelling its process aspects.
New!!: Algorithm characterizations and Data flow diagram · See more »
David Berlinski
David Berlinski (born 1942) is an American author and academic who opposes the scientific consensus on the theory of evolution.
New!!: Algorithm characterizations and David Berlinski · See more »
Decision tree
A decision tree is a decision support tool that uses a tree-like graph or model of decisions and their possible consequences, including chance event outcomes, resource costs, and utility.
New!!: Algorithm characterizations and Decision tree · See more »
Diagonal method
The diagonal method (DM) is a rule of thumb in photography, painting and drawing.
New!!: Algorithm characterizations and Diagonal method · See more »
Donald Knuth
Donald Ervin Knuth (born January 10, 1938) is an American computer scientist, mathematician, and professor emeritus at Stanford University.
New!!: Algorithm characterizations and Donald Knuth · See more »
Emil Leon Post
Emil Leon Post (February 11, 1897 – April 21, 1954) was an American mathematician and logician.
New!!: Algorithm characterizations and Emil Leon Post · See more »
Enumeration
An enumeration is a complete, ordered listing of all the items in a collection.
New!!: Algorithm characterizations and Enumeration · See more »
Euclidean algorithm
. EXAMPLES CAN BE FOUND BELOW, E.G., IN THE "Matrix method" SECTION.
New!!: Algorithm characterizations and Euclidean algorithm · See more »
Formal grammar
In formal language theory, a grammar (when the context is not given, often called a formal grammar for clarity) is a set of production rules for strings in a formal language.
New!!: Algorithm characterizations and Formal grammar · See more »
Formal language
In mathematics, computer science, and linguistics, a formal language is a set of strings of symbols together with a set of rules that are specific to it.
New!!: Algorithm characterizations and Formal language · See more »
Formal system
A formal system is the name of a logic system usually defined in the mathematical way.
New!!: Algorithm characterizations and Formal system · See more »
George Boolos
George Stephen Boolos (September 4, 1940 – May 27, 1996) was an American philosopher and a mathematical logician who taught at the Massachusetts Institute of Technology.
New!!: Algorithm characterizations and George Boolos · See more »
Greatest common divisor
In mathematics, the greatest common divisor (gcd) of two or more integers, which are not all zero, is the largest positive integer that divides each of the integers.
New!!: Algorithm characterizations and Greatest common divisor · See more »
Harry R. Lewis
Lewis has been honored for his "particularly distinguished contributions to undergraduate teaching"; his students have included future entrepreneurs Bill Gates and Mark Zuckerberg, and numerous future faculty members at Harvard and other schools.
New!!: Algorithm characterizations and Harry R. Lewis · See more »
Hartley Rogers Jr.
Hartley Rogers Jr. (1926–2015) was a mathematician who worked in recursion theory, and was a professor in the Mathematics Department of the Massachusetts Institute of Technology.
New!!: Algorithm characterizations and Hartley Rogers Jr. · See more »
Hierarchy
A hierarchy (from the Greek hierarchia, "rule of a high priest", from hierarkhes, "leader of sacred rites") is an arrangement of items (objects, names, values, categories, etc.) in which the items are represented as being "above", "below", or "at the same level as" one another A hierarchy can link entities either directly or indirectly, and either vertically or diagonally.
New!!: Algorithm characterizations and Hierarchy · See more »
Howard Jerome Keisler
Howard Jerome Keisler (born 3 December 1936) is an American mathematician, currently professor emeritus at University of Wisconsin–Madison.
New!!: Algorithm characterizations and Howard Jerome Keisler · See more »
Ian Stewart (mathematician)
Ian Nicholas Stewart (born 24 September 1945) is a British mathematician and a popular-science and science-fiction writer.
New!!: Algorithm characterizations and Ian Stewart (mathematician) · See more »
Intrinsic and extrinsic properties
An intrinsic property is a property of a system or of a material itself or within.
New!!: Algorithm characterizations and Intrinsic and extrinsic properties · See more »
Intuitionism
In the philosophy of mathematics, intuitionism, or neointuitionism (opposed to preintuitionism), is an approach where mathematics is considered to be purely the result of the constructive mental activity of humans rather than the discovery of fundamental principles claimed to exist in an objective reality.
New!!: Algorithm characterizations and Intuitionism · See more »
J. Barkley Rosser
John Barkley Rosser Sr. (December 6, 1907 – September 5, 1989) was an American logician, a student of Alonzo Church, and known for his part in the Church–Rosser theorem, in lambda calculus.
New!!: Algorithm characterizations and J. Barkley Rosser · See more »
Jan van Leeuwen
Jan van Leeuwen (born December 17, 1946 in Waddinxveen) is a Dutch computer scientist and Emeritus professor of computer science at the Department of Information and Computing Sciences at Utrecht University.
New!!: Algorithm characterizations and Jan van Leeuwen · See more »
John P. Burgess
John Patton Burgess (born 5 June 1948) is a John N. Woodhull Professor of Philosophy at Princeton University.
New!!: Algorithm characterizations and John P. Burgess · See more »
John Searle
John Rogers Searle (born 31 July 1932) is an American philosopher.
New!!: Algorithm characterizations and John Searle · See more »
John Venn
John Venn, FRS, FSA, (4 August 1834 – 4 April 1923) was an English logician and philosopher noted for introducing the Venn diagram, used in the fields of set theory, probability, logic, statistics, and computer science.
New!!: Algorithm characterizations and John Venn · See more »
Jon Barwise
Kenneth Jon Barwise (June 29, 1942 – March 5, 2000) was an American mathematician, philosopher and logician who proposed some fundamental revisions to the way that logic is understood and used.
New!!: Algorithm characterizations and Jon Barwise · See more »
Kenneth Kunen
Herbert Kenneth Kunen (born August 2, 1943) is an emeritus professor of mathematics at the University of Wisconsin–Madison who works in set theory and its applications to various areas of mathematics, such as set-theoretic topology and measure theory.
New!!: Algorithm characterizations and Kenneth Kunen · See more »
Kurt Gödel
Kurt Friedrich Gödel (April 28, 1906 – January 14, 1978) was an Austrian, and later American, logician, mathematician, and philosopher.
New!!: Algorithm characterizations and Kurt Gödel · See more »
Lambda calculus
Lambda calculus (also written as λ-calculus) is a formal system in mathematical logic for expressing computation based on function abstraction and application using variable binding and substitution.
New!!: Algorithm characterizations and Lambda calculus · See more »
Logical form
In philosophy and mathematics, a logical form of a syntactic expression is a precisely-specified semantic version of that expression in a formal system.
New!!: Algorithm characterizations and Logical form · See more »
M4 (computer language)
m4 is a general-purpose macro processor included in all UNIX-like operating systems, and is a component of the POSIX standard.
New!!: Algorithm characterizations and M4 (computer language) · See more »
Machine code
Machine code is a computer program written in machine language instructions that can be executed directly by a computer's central processing unit (CPU).
New!!: Algorithm characterizations and Machine code · See more »
Martin Davis
Martin David Davis (born March 8, 1928) is an American mathematician, known for his work on Hilbert's tenth problem.
New!!: Algorithm characterizations and Martin Davis · See more »
Michael Sipser
Michael Fredric Sipser (born September 17, 1954) is a theoretical computer scientist who has made early contributions to computational complexity theory.
New!!: Algorithm characterizations and Michael Sipser · See more »
Mind
The mind is a set of cognitive faculties including consciousness, perception, thinking, judgement, language and memory.
New!!: Algorithm characterizations and Mind · See more »
MIX
MIX is a hypothetical computer used in Donald Knuth's monograph, The Art of Computer Programming (TAOCP).
New!!: Algorithm characterizations and MIX · See more »
Natural number
In mathematics, the natural numbers are those used for counting (as in "there are six coins on the table") and ordering (as in "this is the third largest city in the country").
New!!: Algorithm characterizations and Natural number · See more »
Peter van Emde Boas
Peter van Emde Boas (born 3 April 1945, Amsterdam) is a Dutch computer scientist and professor at the University of Amsterdam.
New!!: Algorithm characterizations and Peter van Emde Boas · See more »
Pointer machine
In theoretical computer science a pointer machine is an "atomistic" abstract computational machine model akin to the random-access machine.
New!!: Algorithm characterizations and Pointer machine · See more »
Post–Turing machine
A Post–Turing machine is a "program formulation" of an especially simple type of Turing machine, comprising a variant of Emil Post's Turing-equivalent model of computation described below.
New!!: Algorithm characterizations and Post–Turing machine · See more »
Primitive recursive function
In computability theory, primitive recursive functions are a class of functions that are defined using primitive recursion and composition as central operations and are a strict subset of the total µ-recursive functions (µ-recursive functions are also called partial recursive).
New!!: Algorithm characterizations and Primitive recursive function · See more »
Programming language
A programming language is a formal language that specifies a set of instructions that can be used to produce various kinds of output.
New!!: Algorithm characterizations and Programming language · See more »
Random-access machine
In computer science, random-access machine (RAM) is an abstract machine in the general class of register machines.
New!!: Algorithm characterizations and Random-access machine · See more »
Random-access stored-program machine
In theoretical computer science the random-access stored-program (RASP) machine model is an abstract machine used for the purposes of algorithm development and algorithm complexity theory.
New!!: Algorithm characterizations and Random-access stored-program machine · See more »
Rózsa Péter
Rózsa Péter, born Politzer, (17 February 1905 – 16 February 1977) was a Hungarian mathematician and logician.
New!!: Algorithm characterizations and Rózsa Péter · See more »
Recursion
Recursion occurs when a thing is defined in terms of itself or of its type.
New!!: Algorithm characterizations and Recursion · See more »
Register machine
In mathematical logic and theoretical computer science a register machine is a generic class of abstract machines used in a manner similar to a Turing machine.
New!!: Algorithm characterizations and Register machine · See more »
Richard Jeffrey
Richard Carl Jeffrey (August 5, 1926 – November 9, 2002) was an American philosopher, logician, and probability theorist.
New!!: Algorithm characterizations and Richard Jeffrey · See more »
Robert I. Soare
Robert Irving Soare is an American mathematician.
New!!: Algorithm characterizations and Robert I. Soare · See more »
Robin Gandy
Robin Oliver Gandy (22 September 1919 – 20 November 1995) was a British mathematician and logician.
New!!: Algorithm characterizations and Robin Gandy · See more »
Semantics
Semantics (from σημαντικός sēmantikós, "significant") is the linguistic and philosophical study of meaning, in language, programming languages, formal logics, and semiotics.
New!!: Algorithm characterizations and Semantics · See more »
State diagram
A state diagram is a type of diagram used in computer science and related fields to describe the behavior of systems.
New!!: Algorithm characterizations and State diagram · See more »
Stephen Cole Kleene
Stephen Cole Kleene (January 5, 1909 – January 25, 1994) was an American mathematician.
New!!: Algorithm characterizations and Stephen Cole Kleene · See more »
Syllogism
A syllogism (συλλογισμός syllogismos, "conclusion, inference") is a kind of logical argument that applies deductive reasoning to arrive at a conclusion based on two or more propositions that are asserted or assumed to be true.
New!!: Algorithm characterizations and Syllogism · See more »
Syntax
In linguistics, syntax is the set of rules, principles, and processes that govern the structure of sentences in a given language, usually including word order.
New!!: Algorithm characterizations and Syntax · See more »
Taxonomy (general)
Taxonomy is the practice and science of classification.
New!!: Algorithm characterizations and Taxonomy (general) · See more »
Tetration
In mathematics, tetration (or hyper-4) is the next hyperoperation after exponentiation, and is defined as iterated exponentiation.
New!!: Algorithm characterizations and Tetration · See more »
Turing completeness
In computability theory, a system of data-manipulation rules (such as a computer's instruction set, a programming language, or a cellular automaton) is said to be Turing complete or computationally universal if it can be used to simulate any Turing machine.
New!!: Algorithm characterizations and Turing completeness · See more »
Turing machine
A Turing machine is a mathematical model of computation that defines an abstract machine, which manipulates symbols on a strip of tape according to a table of rules.
New!!: Algorithm characterizations and Turing machine · See more »
Turing machine equivalents
A Turing machine is a hypothetical computing device, first conceived by Alan Turing in 1936.
New!!: Algorithm characterizations and Turing machine equivalents · See more »
Universal Turing machine
In computer science, a universal Turing machine (UTM) is a Turing machine that can simulate an arbitrary Turing machine on arbitrary input.
New!!: Algorithm characterizations and Universal Turing machine · See more »
Wilhelm Ackermann
Wilhelm Friedrich Ackermann (29 March 1896 – 24 December 1962) was a German mathematician best known for the Ackermann function, an important example in the theory of computation.
New!!: Algorithm characterizations and Wilhelm Ackermann · See more »
William Stanley Jevons
William Stanley Jevons FRS (1 September 1835 – 13 August 1882) was an English economist and logician.
New!!: Algorithm characterizations and William Stanley Jevons · See more »
Yuri Gurevich
Yuri Gurevich is an American computer scientist and mathematician and the inventor of abstract state machines.
New!!: Algorithm characterizations and Yuri Gurevich · See more »
References
[1] https://en.wikipedia.org/wiki/Algorithm_characterizations
