Richard M. Friedberg
 | This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)
|
Richard Friedberg | |
|---|---|
| Born | 8 October 1935 (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]
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.[3]
Early life
[edit]Friedberg was born in Manhattan on Oct 8, 1935, the child of cardiologist Charles K. Friedberg, and playwright Gertrude Tonkonogy.[4]
Academic work
[edit]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.[5][6][7][8]
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”,[9] 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.[10]
Friedberg is also known for his love of music and poetry. He wrote poems in several letters 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.
In 1968 Friedberg wrote an informal book on number theory titled An Adventurer's Guide to Number Theory.[11] 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.[12] The chromosomal rearrangements may be block exchanges, translocation, or inversions. Friedberg has contributed to the task of efficiently sorting such permuations.[13]
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.[14]
Selected publications
[edit]- 1957: (communicated by Kurt Gödel) "Two Recursively Enumerable Sets Not Recursive in Each Other", Proc. Natl. Acad. Sci. U.S.A. vol. 43, p. 236 doi:10.1073/pnas.43.2.236
- 1957: "A criterion for completeness of degrees of unsolvability", Journal of Symbolic Logic 22(2): 159–160.
- 1958: "A Learning Machine: Part I", IBM Journal of Research and Development 2(1)
- 1958: "Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication", Journal of Symbolic Logic 23(3): 309–316.
- 1973: "Frequency Shifts in Emission and Absorption by Resonant Systems of Two-Level Atoms", (with S. R. Hartmann and J. T. Manassah), Phys. Reports 7C, 101
- 1974: "Dual Trees and Resummation Theorems" Journal of Mathematical Physics 16: 20 Bibcode:1975JMP....16...20F
- 1984: (with T. D. Lee) "Derivation of Regge’s Action from Einstein’s Theory of General Relativity", Nuclear Physics B 242, 145
- 1993: "The Electrostatics and Magnetostatics of a Conducting Disc", American Journal of Physics 61: 1084
- 1995: "Path Integrals in Polar Variables with Spontaneously Broken Symmetry", Journal of Mathematical Physics 36: 2675 doi:10.1063/1.531360
- 2005: (with S. Yancopoulos & O. Attie) "Efficient Sorting of Genomic Permutation by Translocation, inversion and block interchange", Bioinformatics 21: 3352–59 doi:10.1093/bioinformatics/bti535
References
[edit]- ^ “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
- ^ “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].
- ^ “A criterion for completeness of degrees of unsolvability", Richard. M. Friedberg, Journal of Symbolic Logic, Volume 22, Issue 2, June 1957, pp. 159-160
- ^ “A Learning Machine: Part I”, R. M. Friedberg, IBM Journal of Research and Development (Volume: 2, Issue: 1, Jan. 1958).
- ^ “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
- ^ The Conceptual Development of Quantum Mechanics. New York: McGraw-Hill, 1966 2nd ed: New York: American Institute of Physics, 1989. ISBN 0-88318-617-9
- ^ “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).
- ^ 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.
- ^ “Efficient Sorting of Genomic Permutation...” S. Yancopoulos, O. Attie, Friedberg, Bioinformatics vol. 21, pp 3352-59 (2005)
- ^ 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.
