Mathematics
•
Computer science
•
Areas of mathematics
•
Graph algorithms
•
Theoretical computer science
•
List of algorithms
Areas of computer science
Outline of computer science
List of basic computer science topics
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
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...
Quantum "Weeping Angel" Effect Freezes Atoms In Place
The paradox of Schroedinger’s Cat famously demonstrates that a quantum cat sealed in a box is both alive and dead at the same time until we look inside, at which point it becomes one or the other. Suc...
Direct measurements of the wave nature of matter
New experimental techniques map out wave properties only known previously from theory.
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...
Simulated Reality
Great documentary !
What is the Uncertainty Principle? - YouTube
Jul 31, 2011 ... The Heisenberg uncertainty principle - in a nutshell! Tweet it - http://bit.ly/pagxNi Facebook it - http://on.fb.me/pzzfqM minutephysics is now on ...
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...
Reality Doesn’t Exist Until We Measure It, Quantum Experiment Confirms
Australian scientists have recreated a famous experiment and confirmed quantum physics's bizarre predictions about the nature of reality, by proving that reality doesn't actually exist until we measur...
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...
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
Uncertainty principle
In quantum mechanics, the uncertainty principle, also known as Heisenberg's uncertainty principle, is any of a variety of mathematical inequalities asserting a fundamental limit to the precision with ...
Uncertainty principle - Wikipedia
Klee-Minty cube
The Klee–Minty cube (named after Victor Klee and George J. Minty) is a unit cube whose corners have been slightly perturbed. Klee and Minty demonstrated that Dantzig's simplex algorithm has poor worst...
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...
LH (complexity)
In computational complexity, the logarithmic time hierarchy (LH) is the complexity class of all computational problems solvable in a logarithmic amount of computation time on an alternating Turing mac...
Probabilistic automaton
In mathematics and computer science, the probabilistic automaton (PA) is a generalization of the non-deterministic finite automaton; it includes the probability of a given transition into the transiti...
Wave-particle duality
Wave–particle duality is the concept that every elementary particle or quantic entity exhibits the properties of not only particles, but also waves. It addresses the inability of the classical concep...
Computing the permanent
In mathematics, the computation of the permanent of a matrix is a problem that is known to be more difficult than the computation of the determinant of a matrix despite the apparent similarity of the ...
Queue automaton
A queue machine or queue automaton is a finite state machine with the ability to store and retrieve data from an infinite-memory queue. It is a model of computation equivalent to a Turing machine, and...
Actor model implementation
In computer science, Actor model implementation concerns implementation issues for the Actor model.
The Caltech Cosmic Cube was developed by Chuck Seitz et al. at Caltech providing architectural s...
Stream X-Machine
The Stream X-machine (SXM) is a model of computation introduced by Gilbert Laycock in his 1993 PhD thesis, The Theory and Practice of Specification Based Software Testing.Based on Samuel Eilenberg's X...
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...