Richard M. Friedberg

Last updated
Richard Friedberg
Born8 October 1935 (1935-10-08) (age 89)
New York City, New York, U.S.
Alma mater Harvard University
Awards William Lowell Putnam Mathematical Competition (1956)
IEEE Evolutionary Computation Pioneer Award (2004)
Scientific career
Fields Physicist
Institutions Barnard College
Columbia University
Doctoral advisor Tsung-Dao Lee

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, [1] particle physics, quantum optics, genome research, and the foundations of quantum physics. [2] [3]

Contents

He has been recognized as a pioneer in machine learning since he wrote on "A learning machine" in 1958. IEEE Neural Networks Society awarded him in 2004, commenting

Today. Friedberg’s initial words from 1958 “Machines would be more useful if they could learn to perform tasks for which they were not given precise methods” are the coin of the realm in computational intelligence. Entire disciplines of evolutionary computation are devoted to problems in automatic programming. Friedberg’s early work truly was a seminal contribution. [4]

Early life

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

Friedberg studied at Harvard University for his bachelor's degree. He finished the William Lowell Putnam Mathematical Competition in 1956 in the top five competitors. [6]

In 1962 obtained a Ph.D. at Columbia University. [7]

Academic work

Friedberg solved a theoretical problem in recursion theory called Post's problem. In computability theory there is the decision problem of whether a given number is in a given set. Turing degree is a measure of the computational challenge. In 1944 Emil Post asked whether intermediate degrees exist on a certain interval of the Turing scale. [8] Albert Muchnik (1956) and Friedberg (1957) proved the Friedberg–Muchnik theorem as the solution. [9]

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

Friedberg has investigated the issue of genome instability by developing a method of comparing genomes and establishing an edit distance between them. The genome variability was modeled with the Double Cut and Join Model. [11] The chromosomal rearrangements may be block exchanges, translocation, or inversions. Friedberg has contributed to the task of efficiently sorting such permutations. [12]

An 1840 work by Olinde Rodrigues has been reviewed by Friedberg who translated the work, provided modern vector notation, diagrams, and annotation of the text. [13]

Selected publications

References

  1. ↑ Friedberg, R.; Lee, T.D. (1984). "Derivation of Regge's action from Einstein's theory of general relativity". Nuclear Physics B. 242 (1): 145–166. Bibcode:1984NuPhB.242..145F. doi:10.1016/0550-3213(84)90137-8.
  2. ↑ Friedberg, R.; Hohenberg, P. C. (2014). "Compatible quantum theory". Reports on Progress in Physics. 77 (9). arXiv: 1405.1961 . Bibcode:2014RPPh...77i2001F. doi:10.1088/0034-4885/77/9/092001. PMID   25146940.
  3. ↑ Friedberg, R.; Hohenberg, P. C. (2018). "What is Quantum Mechanics? A Minimal Formulation". Foundations of Physics. 48 (3): 295–332. arXiv: 1711.04209 . Bibcode:2018FoPh...48..295F. doi:10.1007/s10701-018-0145-4.
  4. ↑ "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.
  5. ↑ Year: 1940; Census Place: New York, New York, New York; Roll: m-t0627-02655; Page: 1A; Enumeration District: 31-1314
  6. ↑ Bush, L. E. (1957). "The William Lowell Putnam Mathematical Competition". The American Mathematical Monthly. 64 (1): 21–27. doi:10.2307/2309081. JSTOR   2309081.
  7. ↑ Richard Michael Friedberg at the Mathematical Genealogy Project
  8. ↑ 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 .
  9. ↑ 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.
  10. ↑ R. M. Friedberg (1968) An Adventurer’s Guide to Number Theory via Google Books
  11. ↑ Richard M. Friedberg; A. E. Darling; S. Yancopoulos (2008). "Genome Rearrangement by the Double Cut and Join Operation". Bioinformatics. Methods in Molecular Biology. Vol. 452. pp. 385–416. doi:10.1007/978-1-60327-159-2_18. ISBN   978-1-58829-707-5. PMID   18566774.
  12. ↑ Yancopoulos, S.; Attie, O.; Friedberg, R. (2005). "Efficient sorting of genomic permutations by translocation, inversion and block interchange". Bioinformatics. 21 (16): 3340–3346. doi: 10.1093/bioinformatics/bti535 . PMID   15951307.
  13. ↑ Friedberg, Richard (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 [math.HO].
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.