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...
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
Mobile automaton
Mobile automaton (plural: mobile automata) is a class of automata similar to cellular automata but which have a single "active" cell instead of updating all cells in parallel. In a mobile automaton, t...
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
Laughter
Laughter is a physical reaction in humans and some species of primate, consisting typically of rhythmical, often audible contractions of the diaphragm and other parts of the respiratory system. It is ...
Laughter - Wikipedia
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...
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...
Chronon
A chronon is a proposed quantum of time, that is, a discrete and indivisible "unit" of time as part of a hypothesis that proposes that time is not continuous.
While time is a continuous quantity i...
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...
Semi-membership
In mathematics and theoretical computer science, the semi-membership problem for a set is the problem of deciding which of two possible elements is logically more likely to belong to that set; alterna...
PSPACE
In computational complexity theory, PSPACE is the set of all decision problems that can be solved by a Turing machine using a polynomial amount of space.
If we denote by SPACE(t(n)), the set of al...
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...