Richard M. Friedberg Explained

Richard Friedberg
Birth Place:New York City, New York, U.S.
Fields:Physicist
Workplaces:Barnard College
Columbia University
Alma Mater:Harvard University
Doctoral Advisor:Tsung-Dao Lee
Awards:William Lowell Putnam Mathematical Competition (1956)
IEEE Evolutionary Computation Pioneer Award (2004)[1]

Richard M. Friedberg (born October 8, 1935) is a theoretical physicist who has contributed to a wide variety of problems in mathematics and physics. These include mathematical logic, number theory, solid state physics, general relativity,[2] particle physics, quantum optics, genome research,[3] and the foundations of quantum physics.[4]

Early life

Friedberg was born in Manhattan on Oct 8, 1935, the child of cardiologist Charles K. Friedberg, and playwright Gertrude Tonkonogy.[5]

Academic work

Friedberg's most well-known work dates back to the mid-1950s. As an undergraduate at Harvard, he published several papers over a period of 2–3 years. The first paper introduced the priority method, a common technique in computability theory, in order to prove the existence of recursively enumerable sets with incomparable degrees of unsolvability.[6] [7] [8] [9]

In 1968, Friedberg proved independently what became known as Bell’s inequality, not knowing that J. S. Bell had proved it a few years earlier. He showed it to the physicist and historian Max Jammer, who somehow managed to insert it into his book “The Conceptual Development of Quantum Mechanics”,[10] although the latter bears the publication date 1966. This caused Friedberg some embarrassment later when classmates at Harvard, knowing of the result only through Jammer’s book, supposed that Friedberg was the first discoverer.(A letter from Friedberg to Jammer dated May 1971 begins, “It was nice of you to remember what I showed you in 1968. I finally got around to writing it up in 1969, but just then I found out about Bell’s 1964 paper (Physics 1, 195) which had anticipated my ‘discovery’ by three years. So I did not publish.”) More recently, Friedberg worked on the foundations of quantum mechanics in collaboration with the late Pierre Hohenberg.[11]

Friedberg is also known for his love of music and poetry. He wrote poems in several letters[12] [13] [14] [15] to cognitive scientist and writer Douglas Hofstadter in 1989. The last letter contains two sonnets ”The Electromagnetic Spectrum” and "Fermions and Bosons". These letters also include critiques and analyses of topics in Metamagical Themas, a collection of articles that Hofstadter wrote for Scientific American during the early 1980s.

Friedberg wrote an informal book on number theory titled "An Adventurer's Guide to Number Theory".[16] In the book, he states, "The difference between the theory of numbers and arithmetic is like the difference between poetry and grammar."

Selected publications

See also

Notes and References

  1. Book: Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat No 04TH8753) CEC-04 . 2023-10-21 . 2004 . xi . 10.1109/CEC.2004.1330827 . 0-7803-8515-2 . en-US . 2004 Pioneer Award - Richard M. Friedberg .
  2. “Derivation of Regge’s Action from Einstein’s Theory of General Relativity”, R. Friedberg and T. D.Lee, Nucl. Phys. B 242, 145 (1984).
  3. “Efficient Sorting of Genomic Permutation...” S. Yancopoulos, O. Attie, Friedberg, Bioinformatics vol. 21, pp 3352-59 (2005)
  4. “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)
  5. Year: 1940; Census Place: New York, New York, New York; Roll: m-t0627-02655; Page: 1A; Enumeration District: 31-1314
  6. “Two Recursively Enumerable Sets Not Recursive in Each Other”, [solution of Post’s problem], Proc. Natl. Acad. Sci. vol. 43, p. 236 (1957) [communicated by [[Kurt Gödel]]].
  7. “A criterion for completeness of degrees of unsolvability", Richard. M. Friedberg, Journal of Symbolic Logic, Volume 22, Issue 2, June 1957, pp. 159-160
  8. “A Learning Machine: Part I”, R. M. Friedberg, IBM Journal of Research and Development (Volume: 2, Issue: 1, Jan. 1958).
  9. “Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication”, Richard M. Friedberg, Journal of Symbolic Logic, Volume 23, Issue 3 September 1958, pp. 309-316
  10. The Conceptual Development of Quantum Mechanics. New York: McGraw-Hill, 1966 2nd ed: New York: American Institute of Physics, 1989.
  11. “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).
  12. http://physics.gmu.edu/~isatija/R2D2.pdf
  13. http://physics.gmu.edu/~isatija/R2D3.pdf
  14. http://physics.gmu.edu/~isatija/R2D4.pdf
  15. http://physics.gmu.edu/~isatija/R2D5.pdf
  16. "An Adventurer’s Guide to Number Theory", R. Friedberg. New York: McGraw-Hill, 1968; reissued by Dover Publications, 1994.

This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Richard M. Friedberg".

Except where otherwise indicated, Everything.Explained.Today is © Copyright 2009-2024, A B Cryer, All Rights Reserved. Cookie policy.