Documents
Entscheidungsproblem
the entscheidungsproblem german language german for decision problem is the challenge in symbolic logic...
Church–Turing thesis
Halting problem
in computability theory the halting problem is a decision problem which can be informally stated as follows given a description of a...
Computable number
in mathematics theoretical computer science and mathematical logic the computable numbers also known as the recursive numbers are the real numbers that can be computed to with...
Alan Turing
...wanted alan to be brought up in england so they returned to paddington london where alan turing was born june as recorded by a blue plaque on the outside of the building now the colo...
Chaitin's constant
Gödel's completeness theorem
Kurt Gödel
Chomsky hierarchy
...in the field of computer science specifically in the area of programming languages the chomsky hierarchy occasionally referred to as chomsky schutzenberger hierarchy is a containment hierarch...
Context-sensitive language
Berry paradox
the berry paradox is the apparent contradiction that arises from expressions such as the following the smallest...
Kolmogorov complexity
in computer science the kolmogorov complexity also known as descriptive complexity kolmogorov chaitin complexity stochastic co...
Gregory Chaitin
Lambda calculus
in mathematical logic and computer science lambda calculus also calculus is a formal system designed to investigate function mathematics...
Formal grammar
in computer science and linguistics a formal grammar or sometimes simply grammar is a precise description of a formal language that is...
Ackermann function
in computability theory the ackermann function or ackermann peter function is a simple example of a computable function that is not p...
Herbert Simon
...prague and koln his european ancestors had been piano builders goldsmiths and vintners herbert simon was educated as a child in the public school system in milwaukee where he developed an interest in sc...
Discrete mathematics
discrete mathematics also called finite mathematics is the study of mathematical structures that are fundamenta...
Game theory
for other uses see game theory disambiguation or game disambiguation game theory is a branch of applied mathemat...
Automated theorem proving
automated theorem proving atp currently the most well developed subfield of automated reasoning ar is the mat...
11 more
