Related Research Articles
Quantum information is the information of the state of a quantum system. It is the basic entity of study in quantum information theory, and can be manipulated using quantum information processing techniques. Quantum information refers to both the technical definition in terms of Von Neumann entropy and the general computational term.
In physics, string theory is a theoretical framework in which the point-like particles of particle physics are replaced by one-dimensional objects called strings. String theory describes how these strings propagate through space and interact with each other. On distance scales larger than the string scale, a string looks just like an ordinary particle, with its mass, charge, and other properties determined by the vibrational state of the string. In string theory, one of the many vibrational states of the string corresponds to the graviton, a quantum mechanical particle that carries the gravitational force. Thus, string theory is a theory of quantum gravity.
Computational physics is the study and implementation of numerical analysis to solve problems in physics. Historically, computational physics was the first application of modern computers in science, and is now a subset of computational science. It is sometimes regarded as a subdiscipline of theoretical physics, but others consider it an intermediate branch between theoretical and experimental physics — an area of study which supplements both theory and experiment.
Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated in the 1930s with the study of computable functions and Turing degrees. The field has since expanded to include the study of generalized computability and definability. In these areas, computability theory overlaps with proof theory and effective descriptive set theory.
Hypercomputation or super-Turing computation is a set of hypothetical models of computation that can provide outputs that are not Turing-computable. For example, a machine that could solve the halting problem would be a hypercomputer; so too would one that could correctly evaluate every statement in Peano arithmetic.
Hilbert's sixth problem is to axiomatize those branches of physics in which mathematics is prevalent. It occurs on the widely cited list of Hilbert's problems in mathematics that he presented in the year 1900. In its common English translation, the explicit statement reads:
The Immirzi parameter is a numerical coefficient appearing in loop quantum gravity (LQG), a nonperturbative theory of quantum gravity. The Immirzi parameter measures the size of the quantum of area in Planck units. As a result, its value is currently fixed by matching the semiclassical black hole entropy, as calculated by Stephen Hawking, and the counting of microstates in loop quantum gravity.
In computer science and mathematical logic the Turing degree or degree of unsolvability of a set of natural numbers measures the level of algorithmic unsolvability of the set.
In general relativity, Regge calculus is a formalism for producing simplicial approximations of spacetimes that are solutions to the Einstein field equation. The calculus was introduced by the Italian theoretician Tullio Regge in 1961.
In quantum physics, Regge theory is the study of the analytic properties of scattering as a function of angular momentum, where the angular momentum is not restricted to be an integer multiple of ħ but is allowed to take any complex value. The nonrelativistic theory was developed by Tullio Regge in 1959.
Tullio Eugenio Regge was an Italian theoretical physicist.
Nathaniel David Mermin is a solid-state physicist at Cornell University best known for the eponymous Hohenberg–Mermin–Wagner theorem, his application of the term "boojum" to superfluidity, his textbook with Neil Ashcroft on solid-state physics, and for contributions to the foundations of quantum mechanics and quantum information science.
In recursion theory, the mathematical theory of computability, a maximal set is a coinfinite recursively enumerable subset A of the natural numbers such that for every further recursively enumerable subset B of the natural numbers, either B is cofinite or B is a finite variant of A or B is not a superset of A. This gives an easy definition within the lattice of the recursively enumerable sets.
Robert Geroch is an American theoretical physicist and professor at the University of Chicago. He has worked prominently on general relativity and mathematical physics and has promoted the use of category theory in mathematics and physics. He was the Ph.D. supervisor for Abhay Ashtekar, Basilis Xanthopoulos and Gary Horowitz. He also proved an important theorem in spin geometry.
Albert Abramovich Muchnik was a Russian mathematician who worked in the field of foundations and mathematical logic.
Pierre Hohenberg was a French-American theoretical physicist, who worked primarily on statistical mechanics.
In computability theory, a Friedberg numbering is a numbering (enumeration) of the set of all uniformly recursively enumerable sets that has no repetitions: each recursively enumerable set appears exactly once in the enumeration.
In mathematical logic, the Friedberg–Muchnik theorem is a theorem about Turing reductions that was proven independently by Albert Muchnik and Richard Friedberg in the middle of the 1950s. It is a more general view of the Kleene–Post theorem. The Kleene–Post theorem states that there exist incomparable languages A and B below K. The Friedberg–Muchnik theorem states that there exist incomparable, computably enumerable languages A and B. Incomparable meaning that there does not exist a Turing reduction from A to B or a Turing reduction from B to A. It is notable for its use of the priority finite injury approach.
David Horn is a Professor (Emeritus) of Physics in the School of Physics and Astronomy at Tel Aviv University (TAU), Israel. He has served as Vice-Rector of TAU, Chairman of the School of Physics and Astronomy and as Dean of the Faculty of Exact Sciences in TAU. He is a fellow of the American Physical Society, nominated for "contributions to theoretical particle physics, including the seminal work on finite energy sum rules, research of the phenomenology of hadronic processes, and investigation of Hamiltonian lattice theories".
References
- ↑ “Derivation of Regge’s Action from Einstein’s Theory of General Relativity”, R. Friedberg and T. D. Lee, Nucl. Phys. B 242, 145 (1984).
- ↑ “Compatible Quantum Theory”, R. Friedberg, P.C. Hohenberg, Rep. Prog. Phys. 77, 2014, 092001 - 092035; “What is Quantum Mechanics? A Minimal Formulation R. Friedberg, P. C. Hohenberg”, Published by Springer-Verlag 21 February 2018 by Springer-Verlag in Foundations of Physics, Feb 21, page 1 (2018)
- ↑ "2004 Pioneer Award - Richard M. Friedberg". Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat No 04TH8753) CEC-04. 2004. pp. xi. doi:10.1109/CEC.2004.1330827. ISBN 0-7803-8515-2 . Retrieved 2023-10-21.
- ↑ Year: 1940; Census Place: New York, New York, New York; Roll: m-t0627-02655; Page: 1A; Enumeration District: 31-1314
- ↑ L.E. Bush (1957) "William Lowell Putnam Mathematics Competition", American Mathematical Monthly 64(1): 21
- ↑ Richard Michael Friedberg at the Mathematical Genealogy Project
- ↑ Post, Emil Leon (1944). "Recursively enumerable sets of positive integers and their decision problems". Bulletin of the American Mathematical Society. 50 (5): 284–316. doi: 10.1090/s0002-9904-1944-08111-1 .
- ↑ Kozen, Dexter (2006). Lecture 38: The Friedberg–Muchnik Theorem. Theory of Computation. London: Springer. pp. 253–256. doi:10.1007/1-84628-477-5_48.
- ↑ R. M. Friedberg (1968) An Adventurer’s Guide to Number Theory via Google Books
- ↑ Richard M. Friedberg; A. E. Darling; S. Yancopoulos (2008). "Genome rearrangement by the double cut and join operation. Each of these individual operations involves 2 cuts and 2 joins of the genomic DNA". Methods in Molecular Biology . 452: 385–416. doi:10.1007/978-1-60327-159-2_18. PMID 18566774.
- ↑ S. Yancopoulos, O. Attie, Friedberg (2005) "Efficient sorting of genomic permutation...", Bioinformatics 21: 3352-59
- ↑ Richard M. Friedberg] (2022) "Rodrigues, Olinde: "Des lois géométriques qui régissent les déplacements d'un systéme solide...", translation and commentary". arXiv:2211.07787.
