Mathematics
•
Computer science
•
Areas of mathematics
•
Graph algorithms
•
Theoretical computer science
•
List of algorithms
Areas of computer science
List of basic computer science topics
Outline of computer science
Theory of computation
In theoretical computer science and mathematics, the theory of computation is the branch that deals with how efficiently problems can be solved on a model of computation, using an algorithm. The fiel...
History of theory of computation
•
Automata theory
•
Computability theory
•
Computational complexity theory
•
Model of computation
•
Algorithmic information theory
•
Arithmetic logic unit
•
Hypercomputation
•
Recursion
•
Turing machine
Elon Musk Estimates Chance That We’re NOT Living in a Computer Simulation — and It’s Really, Really Small
Elon Musk, the well-known entrepreneur behind Tesla and SpaceX, believes there's a "one-in-billions" chance humanity is not living in a computer simulation. Speaking at tech publication Recode's annu...
Simulated Reality
Great documentary !
You are a Simulation & Physics Can Prove It
Astrophysicist, cosmologist and Nobel Prize winner George Smoot studies the cosmic microwave background radiation — the afterglow of the Big Bang. His pionee...
Digital Physics Argument for God's Existence
To help support this ministry click here: http://www.patreon.com/inspiringphilosophy Is it is possible we are living in a virtual reality? If so what does th...
10 Reasons Our Universe Might Actually Be Virtual Reality
Physical realism is the view that the physical world we see is real and exists by itself, alone. Most people think this is self-evident, but physical realism has been struggling with the facts of phys...
History of theory of computation
In theoretical computer science and mathematics, the theory of computation is the branch that deals with how efficiently problems can be solved on a model of computation, using an algorithm. The fiel...
Automata theory
Automata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them. It is a theory in theoretical computer science, under Discrete math...
Automata theory - Wikipedia
Computability theory
Computability theory, also called recursion theory, is a branch of mathematical logic, of computer science, and of the theory of computation that originated in the 1930s with the study of computable f...
Computational complexity theory
Computational complexity theory is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent ...
Model of computation
In computability theory and computational complexity theory, a model of computation is the definition of the set of allowable operations used in computation and their respective costs. It is used for ...
Algorithmic information theory
Algorithmic information theory is a subfield of information theory and computer science that concerns itself with the relationship between computation and information. According to Gregory Chaitin, it...
Arithmetic logic unit
In digital electronics, an arithmetic logic unit (ALU) is a digital circuit that performs arithmetic and bitwise logical operations on integer binary numbers. It is a fundamental building block of the...
Arithmetic logic unit - Wikipedia
Hypercomputation
Hypercomputation or super-Turing computation refers to models of computation that go beyond, or are incomparable to, Turing computability. This includes various hypothetical methods for the computatio...
Recursion
Recursion is the process of repeating items in a self-similar way. For instance, when the surfaces of two mirrors are exactly parallel with each other, the nested images that occur are a form of infin...
Recursion - Wikipedia
Turing machine
A Turing machine is a hypothetical device that manipulates symbols on a strip of tape according to a table of rules. Despite its simplicity, a Turing machine can be adapted to simulate the logic of an...
Turing machine - Wikipedia
Elon Musk Estimates Chance That We’re NOT Living in a Computer Simulation — and It’s Really, Really Small
Elon Musk, the well-known entrepreneur behind Tesla and SpaceX, believes there's a "one-in-billions" chance humanity is not living in a computer simulation. Speaking at tech publication Recode's annu...
Java Persistence API
The Java Persistence API (JPA) is a Java programming language application programming interface specification that describes the management of relational data in applications using Java Platform, Stan...
ExSpecT
Blum's speedup theorem
In computational complexity theory Blum's speedup theorem, first stated by Manuel Blum in 1967, is a fundamental theorem about the complexity of computable functions. Each computable function has an i...
Malament–Hogarth spacetime
A Malament–Hogarth (M-H) spacetime, named after David B. Malament and Mark Hogarth, is a relativistic spacetime that possesses the following property: there exists a worldline and an event suc...
Corecursion
In computer science, corecursion is a type of operation that is dual to recursion. Whereas recursion works analytically, starting on data further from a base case and breaking it down into smaller dat...
Introduction to the Theory of Computation
Introduction to the Theory of Computation (ISBN 0-534-95097-3) is a standard textbook in theoretical computer science, written by Michael Sipser and first published by PWS Publishing in 1997.
Decision Linear assumption
The Decision Linear (DLIN) assumption is a mathematical assumption used in elliptic curve cryptography. In particular, the DLIN assumption is useful in settings where the decisional Diffie–Hellm...
Recursive languages and sets
Nondeterministic algorithm
In computer science, a nondeterministic algorithm is an algorithm that, even for the same input, can exhibit different behaviors on different runs, as opposed to a deterministic algorithm. There are s...
Reachability problem
Reachability is a fundamental problem that appears in several different contexts: finite- and infinite-state concurrent systems, computational models like cellular automata and Petri nets, program ana...
Computation history
In computer science, a computation history is a sequence of steps taken by an abstract machine in the process of computing its result. Computation histories are frequently used in proofs about the ca...
List of undecidable problems
In computability theory, an undecidable problem is of a type of calculation which requires a yes/no answer, but where there can not possibly be any computer program that always gives the correct answe...
Numbering (computability theory)
In computability theory a numbering is the assignment of natural numbers to a set of objects such as functions, rational numbers, graphs, or words in some language. A numbering can be used to transfer...
(SAT, ε-UNSAT)
In computational complexity theory, (SAT, ε-UNSAT) is a language that is used in the proof of the PCP theorem, which relates the language NP to probabilistically checkable proof systems.For a given 3-...
(SAT, ε-UNSAT) - Wikipedia