[go: nahoru, domu]
Jump to content

Leonard Adleman: Difference between revisions

From Wikipedia, the free encyclopedia
Browse history interactively
← Previous edit
Content deleted Content added
VisualWikitext
"theory of Strata" claim, is unsubstantiated, even after a long search for such.
m WP:INFONAT cleanup - omit nationality/citizenship if same as birth country (via WP:JWB)
 
(20 intermediate revisions by 19 users not shown)
Line 1: Line 1:
{{Use American English|date=February 2024}}
{{Short description|American computer scientist}}
{{primary sources|date=May 2020}}
{{primary sources|date=May 2020}}
{{Infobox scientist
{{Infobox scientist
Line 6: Line 8:
| birth_date = {{birth date and age|1945|12|31}}
| birth_date = {{birth date and age|1945|12|31}}
| birth_place = [[San Francisco]], California, US
| birth_place = [[San Francisco]], California, US
| nationality = American
| alma_mater = [[University of California, Berkeley]]
| alma_mater = [[University of California, Berkeley]]
| fields = [[Computer science]], [[Cryptography]]
| fields = [[Computer science]], [[Cryptography]]
Line 17: Line 18:
}}
}}


'''Leonard Adleman''' (born December 31, 1945) is an American computer scientist. He is one of the creators of the [[RSA (cryptosystem)|RSA]] encryption algorithm, for which he received the 2002 [[Turing Award]], often called the [[Nobel prize]] of [[Computer science]].<ref name=":0">{{Cite web|title = Leonard M. Adleman {{!}} American computer scientist|url = http://www.britannica.com/biography/Leonard-M-Adleman|website = Encyclopædia Britannica|accessdate = 2015-11-24}}</ref> He is also known for the creation of the field of [[DNA computing]].
'''Leonard Adleman''' (born December 31, 1945) is an American computer scientist. He is one of the creators of the [[RSA (cryptosystem)|RSA]] encryption algorithm, for which he received the 2002 [[Turing Award]].<ref name=":0">{{Cite web|title = Leonard M. Adleman {{!}} American computer scientist|url = http://www.britannica.com/biography/Leonard-M-Adleman|website = Encyclopædia Britannica|access-date = 2015-11-24}}</ref> He is also known for the creation of the field of [[DNA computing]].


== Biography ==
== Biography ==
Leonard M. Adleman was born to a [[Jewish]]<ref name="amturing.acm.org">[https://amturing.acm.org/pdf/AdlemanTuringTranscript.pdf Leonard (Len) Max Adleman 2002 Recipient of the ACM Turing Award] Interviewed by Hugh Williams, August 18, 2016 amturing.acm.org</ref> family in [[California]]. His family had originally immigrated to the United States from modern-day [[Belarus]], from the [[Minsk]] area.<ref name="amturing.acm.org"/> He grew up in [[San Francisco]] and attended the [[University of California, Berkeley]], where he received his [[Bachelor of Arts|BA]] degree in mathematics in 1968 and his [[Doctor of Philosophy|Ph.D.]] degree in [[Electrical Engineering and Computer Science|EECS]] in 1976.<ref name=":0" /><ref>{{MathGenealogy|62298}}</ref> He was also the mathematical consultant on the movie ''[[Sneakers (1992 film)|Sneakers]]''.<ref>{{Cite web|title = Sneakers|url = http://www.usc.edu/dept/molecular-science/fm-sneakers.htm|website = www.usc.edu|accessdate = 2015-11-24|url-status = dead|archiveurl = https://web.archive.org/web/20151101121012/http://www.usc.edu/dept/molecular-science/fm-sneakers.htm|archivedate = 2015-11-01}}</ref> He is a member of the [[National Academy of Engineering]]<ref>{{Cite web|title = NAE Website - Dr. Leonard M. Adleman|url = https://www.nae.edu/MembersSection/MemberDirectory/30191.aspx|website = www.nae.edu|accessdate = 2015-11-24}}</ref> and the [[National Academy of Sciences]].<ref>{{Cite web|title = Leonard Adleman|url = http://www.nasonline.org/member-directory/members/3000975.html|website = www.nasonline.org|accessdate = 2015-11-24}}</ref>
Leonard M. Adleman was born to a [[Jewish]]<ref name="amturing.acm.org">[https://amturing.acm.org/pdf/AdlemanTuringTranscript.pdf Leonard (Len) Max Adleman 2002 Recipient of the ACM Turing Award] Interviewed by Hugh Williams, August 18, 2016 amturing.acm.org</ref> family in [[California]]. His family had originally immigrated to the United States from modern-day [[Belarus]], from the [[Minsk]] area.<ref name="amturing.acm.org"/> He grew up in [[San Francisco]] and attended the [[University of California, Berkeley]], where he received his [[Bachelor of Arts|B.A.]] degree in mathematics in 1968 and his [[Doctor of Philosophy|Ph.D.]] degree in [[electrical engineering and computer science|EECS]] in 1976.<ref name=":0" /><ref>{{MathGenealogy|62298}}</ref> He was also the mathematical consultant on the movie ''[[Sneakers (1992 film)|Sneakers]]''.<ref>{{Cite web|title = Sneakers|url = http://www.usc.edu/dept/molecular-science/fm-sneakers.htm|website = www.usc.edu|access-date = 2015-11-24|url-status = dead|archive-url = https://web.archive.org/web/20151101121012/http://www.usc.edu/dept/molecular-science/fm-sneakers.htm|archive-date = 2015-11-01}}</ref> In 1996, he became a member of the [[National Academy of Engineering]]<ref>{{Cite web|title = NAE Website - Dr. Leonard M. Adleman|url = https://www.nae.edu/MembersSection/MemberDirectory/30191.aspx|website = www.nae.edu|access-date = 2015-11-24}}</ref> for contributions to the theory of computation and cryptography. He is also a member of the [[National Academy of Sciences]].<ref>{{Cite web|title = Leonard Adleman|url = http://www.nasonline.org/member-directory/members/3000975.html|website = www.nasonline.org|access-date = 2015-11-24}}</ref>


Adleman is also an amateur boxer and has sparred with [[James Toney]].<ref>[https://www.youtube.com/watch?v=N64ItOBBg2w Professor Adleman versus World Champion Boxer –] YouTube</ref>
Adleman is also an amateur boxer and has sparred with [[James Toney]].<ref>[https://www.youtube.com/watch?v=N64ItOBBg2w Professor Adleman versus World Champion Boxer –] YouTube</ref>


== Discovery ==
== Discovery ==
In 1994, his paper ''Molecular Computation of Solutions To Combinatorial Problems'' described the experimental use of [[DNA]] as a computational system.<ref>{{Cite web|title = Adleman Papers|url = http://www.usc.edu/dept/molecular-science/fm-adleman-papers.htm|website = www.usc.edu|accessdate = 2015-11-24|url-status = dead|archiveurl = https://web.archive.org/web/20160304113733/http://www.usc.edu/dept/molecular-science/fm-adleman-papers.htm|archivedate = 2016-03-04}}</ref> In it, he solved a seven-node instance of the [[Hamiltonian path|Hamiltonian Graph]] problem, an [[NP-complete]] problem similar to the [[travelling salesman problem]]. While the solution to a seven-node instance is [[Trivial (mathematics)|trivial]], this paper is the first known instance of the successful use of DNA to compute an [[algorithm]]. DNA computing has been shown to have potential as a means to solve several other large-scale combinatorial search problems.<ref>{{Cite journal|url =https://www.usc.edu/dept/molecular-science/papers/adleman-science.pdf|title =Molecular Computation of Solutions to Combinatorial Problems|date =November 11, 1994|journal =Science|volume =266|issue =5187|pages =1021–1024|doi =10.1126/science.7973651|url-status =dead|archiveurl =https://web.archive.org/web/20151125060602/https://www.usc.edu/dept/molecular-science/papers/adleman-science.pdf|archivedate =November 25, 2015|bibcode =1994Sci...266.1021A|last1 =Adleman|first1 =Leonard M.|citeseerx =10.1.1.54.2565|pmid=7973651}}</ref> Adleman is widely referred to as the Father of DNA Computing.<ref>{{Cite web | url=http://www-cs-faculty.stanford.edu/~eroberts/courses/soco/projects/2003-04/dna-computing/adleman_bio.htm | title=Leonard Adleman}}</ref>
In 1994, his paper ''Molecular Computation of Solutions To Combinatorial Problems'' described the experimental use of [[DNA]] as a computational system.<ref>{{Cite web|title = Adleman Papers|url = http://www.usc.edu/dept/molecular-science/fm-adleman-papers.htm|website = www.usc.edu|access-date = 2015-11-24|url-status = dead|archive-url = https://web.archive.org/web/20160304113733/http://www.usc.edu/dept/molecular-science/fm-adleman-papers.htm|archive-date = 2016-03-04}}</ref> In it, he solved a seven-node instance of the [[Hamiltonian path|Hamiltonian Graph]] problem, an [[NP-complete]] problem similar to the [[travelling salesman problem]]. While the solution to a seven-node instance is [[Trivial (mathematics)|trivial]], this paper is the first known instance of the successful use of DNA to compute an [[algorithm]]. DNA computing has been shown to have potential as a means to solve several other large-scale combinatorial search problems.<ref>{{Cite journal|url =https://www.usc.edu/dept/molecular-science/papers/adleman-science.pdf|title =Molecular Computation of Solutions to Combinatorial Problems|date =November 11, 1994|journal =Science|volume =266|issue =5187|pages =1021–1024|doi =10.1126/science.7973651|url-status =dead|archive-url =https://web.archive.org/web/20151125060602/https://www.usc.edu/dept/molecular-science/papers/adleman-science.pdf|archive-date =November 25, 2015|bibcode =1994Sci...266.1021A|last1 =Adleman|first1 =Leonard M.|citeseerx =10.1.1.54.2565|pmid=7973651}}</ref> Adleman is widely referred to as the Father of DNA Computing.<ref>{{Cite web | url=http://www-cs-faculty.stanford.edu/~eroberts/courses/soco/projects/2003-04/dna-computing/adleman_bio.htm | title=Leonard Adleman}}</ref>


In 2002, he and his research group managed to solve a 'nontrivial' problem using DNA computation.{{citation needed|date=January 2016}} Specifically, they solved a 20-variable [[Boolean satisfiability problem|SAT]] problem having more than 1 million potential solutions. They did it in a manner similar to the one Adleman used in his seminal 1994 paper. First, a mixture of DNA strands logically representative of the problem's solution space was synthesized. This mixture was then operated upon algorithmically using biochemical techniques to winnow out the 'incorrect' strands, leaving behind only those strands that 'satisfied' the problem. Analysis of the nucleotide sequence of these remaining strands revealed 'correct' solutions to the original problem.<ref name=":0" />
In 2002, he and his research group managed to solve a 'nontrivial' problem using DNA computation.<ref name="Braich et al 2002 pp. 499–502">{{cite journal | last1=Braich | first1=Ravinderjit S. | last2=Chelyapov | first2=Nickolas | last3=Johnson | first3=Cliff | last4=Rothemund | first4=Paul W. K. | last5=Adleman | first5=Leonard | title=Solution of a 20-Variable 3-SAT Problem on a DNA Computer | journal=Science | volume=296 | issue=5567 | date=2002-04-19 | issn=0036-8075 | doi=10.1126/science.1069528 | pages=499–502| pmid=11896237 | bibcode=2002Sci...296..499B }}</ref> Specifically, they solved a 20-variable [[Boolean satisfiability problem|SAT]] problem having more than 1 million potential solutions. They did it in a manner similar to the one Adleman used in his seminal 1994 paper. First, a mixture of DNA strands logically representative of the problem's solution space was synthesized. This mixture was then operated upon algorithmically using biochemical techniques to winnow out the 'incorrect' strands, leaving behind only those strands that 'satisfied' the problem. Analysis of the nucleotide sequence of these remaining strands revealed 'correct' solutions to the original problem.<ref name=":0" />


He is one of the original discoverers of the [[Adleman–Pomerance–Rumely primality test]].<ref>{{Cite book|title = Primality testing algorithms [after Adleman, Rumely and Williams], volume 901 of Lecture Notes in Mathematics|last = |first = |publisher = Springer Berlin|year = 1981|isbn = |location = |pages = }}</ref><ref>{{Cite web|title = NAE Website - DNA Computing by Self-Assembly|url = http://www.nae.edu/Publications/Bridge/ExpansionofFrontiersofEngineering/DNAComputingbySelf-Assembly.aspx|website = www.nae.edu|accessdate = 2015-11-24}}</ref>
He is one of the original discoverers of the [[Adleman–Pomerance–Rumely primality test]].<ref>{{Cite book|title = Primality testing algorithms [after Adleman, Rumely and Williams], volume 901 of Lecture Notes in Mathematics|publisher = Springer Berlin|year = 1981}}</ref><ref>{{Cite web|title = NAE Website - DNA Computing by Self-Assembly|url = http://www.nae.edu/Publications/Bridge/ExpansionofFrontiersofEngineering/DNAComputingbySelf-Assembly.aspx|website = www.nae.edu|access-date = 2015-11-24}}</ref>


[[Fred Cohen]], in his 1984 paper, ''Experiments with Computer Viruses'' credited Adleman with coining the term "[[computer virus]]".<ref>{{Citation | last = Cohen | first = Fred | title = Computer Viruses – Theory and Experiments | year = 1984 | url = http://all.net/books/virus/index.html}}</ref>
[[Fred Cohen]], in his 1984 paper, ''Experiments with Computer Viruses'' credited Adleman with coining the term "[[computer virus]]".<ref>{{Citation | last = Cohen | first = Fred | title = Computer Viruses – Theory and Experiments | year = 1984 | url = http://all.net/books/virus/index.html}}</ref>


As of 2017, Adleman is working on the mathematical theory of Strata, however, no results have been disclosed, and a wikipedia search reveals that there are no other references to such a 'theory of strata', even though it would be interesting if it had been elaborated. He is a Computer Science professor at the University of Southern California.<ref>{{Cite web|url=https://www.cs.usc.edu/people/faculty/tenured-tenure-track-faculty/adleman-leonard|title=Adleman, Leonard - USC Viterbi Department of Computer Science|website=www.cs.usc.edu|language=en|access-date=2017-08-22|url-status=dead|archiveurl=https://web.archive.org/web/20170822215532/https://www.cs.usc.edu/people/faculty/tenured-tenure-track-faculty/adleman-leonard|archivedate=2017-08-22}}</ref>
As of 2017, Adleman is working on the mathematical theory of Strata. He is a Computer Science professor at the University of Southern California.<ref>{{Cite web|url=https://www.cs.usc.edu/people/faculty/tenured-tenure-track-faculty/adleman-leonard|title=Adleman, Leonard - USC Viterbi Department of Computer Science|website=www.cs.usc.edu|language=en|access-date=2017-08-22|url-status=dead|archive-url=https://web.archive.org/web/20170822215532/https://www.cs.usc.edu/people/faculty/tenured-tenure-track-faculty/adleman-leonard|archive-date=2017-08-22}}</ref>


== Awards ==
== Awards ==
For his contribution to the invention of the [[RSA (algorithm)|RSA]] cryptosystem, Adleman, along with [[Ron Rivest]] and [[Adi Shamir]], has been a recipient of the 1996 [[Paris Kanellakis Theory and Practice Award]] and the 2002 [[ACM Turing Award]], often called the [[Nobel Prize]] of Computer Science.<ref name=":0" /> Adleman was elected a Fellow of the [[American Academy of Arts and Sciences]] in 2006.<ref name="AAAS">{{cite web|title=Book of Members, 1780-2010: Chapter A|url=http://www.amacad.org/publications/BookofMembers/ChapterA.pdf|publisher=American Academy of Arts and Sciences|accessdate=6 April 2011}}</ref>
For his contribution to the invention of the [[RSA (algorithm)|RSA]] cryptosystem, Adleman, along with [[Ron Rivest]] and [[Adi Shamir]], has been a recipient of the 1996 [[Paris Kanellakis Theory and Practice Award]] and the 2002 [[Turing Award]], often called the [[Nobel Prize]] of Computer Science.<ref name=":0" /> Adleman was elected a Fellow of the [[American Academy of Arts and Sciences]] in 2006<ref name="AAAS">{{cite web|title=Book of Members, 1780-2010: Chapter A|url=http://www.amacad.org/publications/BookofMembers/ChapterA.pdf|publisher=American Academy of Arts and Sciences|access-date=6 April 2011}}</ref> and a 2021 [[ACM Fellow]].<ref>{{cite web|title=ACM Names 71 Fellows for Computing Advances that are Driving Innovation|publisher=[[Association for Computing Machinery]]|date=January 19, 2022|access-date=2022-01-19|url=https://www.acm.org/media-center/2022/january/fellows-2021}}</ref>


== See also ==
== See also ==
* [[List of programmers|List of famous programmers]]
* [[List of programmers|List of famous programmers]]
* [[List of important publications in computer science#Networks and security|Important publications in cryptography]]


== References ==
== References ==
Line 60: Line 60:
[[Category:American computer programmers]]
[[Category:American computer programmers]]
[[Category:American science writers]]
[[Category:American science writers]]
[[Category:People of Belarusian-Jewish descent]]
[[Category:American people of Belarusian-Jewish descent]]
[[Category:1945 births]]
[[Category:1945 births]]
[[Category:Living people]]
[[Category:Living people]]
[[Category:Modern cryptographers]]
[[Category:Public-key cryptographers]]
[[Category:Public-key cryptographers]]
[[Category:Scientists from the San Francisco Bay Area]]
[[Category:Scientists from the San Francisco Bay Area]]
Line 69: Line 68:
[[Category:University of Southern California faculty]]
[[Category:University of Southern California faculty]]
[[Category:Writers from San Francisco]]
[[Category:Writers from San Francisco]]
[[Category:Jewish scientists]]
[[Category:Jewish American scientists]]
[[Category:Jewish biologists]]
[[Category:Jewish biologists]]
[[Category:UC Berkeley College of Engineering alumni]]
[[Category:UC Berkeley College of Engineering alumni]]
[[Category:Fellows of the American Academy of Arts and Sciences]]
[[Category:Fellows of the American Academy of Arts and Sciences]]
[[Category:2021 Fellows of the Association for Computing Machinery]]
[[Category:Members of the United States National Academy of Engineering]]
[[Category:Members of the United States National Academy of Engineering]]
[[Category:Members of the United States National Academy of Sciences]]
[[Category:Members of the United States National Academy of Sciences]]
Line 78: Line 78:
[[Category:21st-century American scientists]]
[[Category:21st-century American scientists]]
[[Category:Computer security academics]]
[[Category:Computer security academics]]
[[Category:UC Berkeley College of Letters and Science alumni]]

Latest revision as of 18:40, 25 June 2024

Leonard Adleman
Born
Leonard Max Adleman

(1945-12-31) December 31, 1945 (age 78)
San Francisco, California, US
Alma materUniversity of California, Berkeley
Known forRSA
Awards2002 Turing Award
Scientific career
FieldsComputer science, Cryptography
InstitutionsUniversity of Southern California
Thesis Number-Theoretic Aspects of Computational Complexity  (1976)
Doctoral advisorManuel Blum

Leonard Adleman (born December 31, 1945) is an American computer scientist. He is one of the creators of the RSA encryption algorithm, for which he received the 2002 Turing Award.[1] He is also known for the creation of the field of DNA computing.

Biography[edit]

Leonard M. Adleman was born to a Jewish[2] family in California. His family had originally immigrated to the United States from modern-day Belarus, from the Minsk area.[2] He grew up in San Francisco and attended the University of California, Berkeley, where he received his B.A. degree in mathematics in 1968 and his Ph.D. degree in EECS in 1976.[1][3] He was also the mathematical consultant on the movie Sneakers.[4] In 1996, he became a member of the National Academy of Engineering[5] for contributions to the theory of computation and cryptography. He is also a member of the National Academy of Sciences.[6]

Adleman is also an amateur boxer and has sparred with James Toney.[7]

Discovery[edit]

In 1994, his paper Molecular Computation of Solutions To Combinatorial Problems described the experimental use of DNA as a computational system.[8] In it, he solved a seven-node instance of the Hamiltonian Graph problem, an NP-complete problem similar to the travelling salesman problem. While the solution to a seven-node instance is trivial, this paper is the first known instance of the successful use of DNA to compute an algorithm. DNA computing has been shown to have potential as a means to solve several other large-scale combinatorial search problems.[9] Adleman is widely referred to as the Father of DNA Computing.[10]

In 2002, he and his research group managed to solve a 'nontrivial' problem using DNA computation.[11] Specifically, they solved a 20-variable SAT problem having more than 1 million potential solutions. They did it in a manner similar to the one Adleman used in his seminal 1994 paper. First, a mixture of DNA strands logically representative of the problem's solution space was synthesized. This mixture was then operated upon algorithmically using biochemical techniques to winnow out the 'incorrect' strands, leaving behind only those strands that 'satisfied' the problem. Analysis of the nucleotide sequence of these remaining strands revealed 'correct' solutions to the original problem.[1]

He is one of the original discoverers of the Adleman–Pomerance–Rumely primality test.[12][13]

Fred Cohen, in his 1984 paper, Experiments with Computer Viruses credited Adleman with coining the term "computer virus".[14]

As of 2017, Adleman is working on the mathematical theory of Strata. He is a Computer Science professor at the University of Southern California.[15]

Awards[edit]

For his contribution to the invention of the RSA cryptosystem, Adleman, along with Ron Rivest and Adi Shamir, has been a recipient of the 1996 Paris Kanellakis Theory and Practice Award and the 2002 Turing Award, often called the Nobel Prize of Computer Science.[1] Adleman was elected a Fellow of the American Academy of Arts and Sciences in 2006[16] and a 2021 ACM Fellow.[17]

See also[edit]

References[edit]

  1. ^ a b c d "Leonard M. Adleman | American computer scientist". Encyclopædia Britannica. Retrieved 2015-11-24.
  2. ^ a b Leonard (Len) Max Adleman 2002 Recipient of the ACM Turing Award Interviewed by Hugh Williams, August 18, 2016 amturing.acm.org
  3. ^ Leonard Adleman at the Mathematics Genealogy Project
  4. ^ "Sneakers". www.usc.edu. Archived from the original on 2015-11-01. Retrieved 2015-11-24.
  5. ^ "NAE Website - Dr. Leonard M. Adleman". www.nae.edu. Retrieved 2015-11-24.
  6. ^ "Leonard Adleman". www.nasonline.org. Retrieved 2015-11-24.
  7. ^ Professor Adleman versus World Champion Boxer – YouTube
  8. ^ "Adleman Papers". www.usc.edu. Archived from the original on 2016-03-04. Retrieved 2015-11-24.
  9. ^ Adleman, Leonard M. (November 11, 1994). "Molecular Computation of Solutions to Combinatorial Problems" (PDF). Science. 266 (5187): 1021–1024. Bibcode:1994Sci...266.1021A. CiteSeerX 10.1.1.54.2565. doi:10.1126/science.7973651. PMID 7973651. Archived from the original (PDF) on November 25, 2015.
  10. ^ "Leonard Adleman".
  11. ^ Braich, Ravinderjit S.; Chelyapov, Nickolas; Johnson, Cliff; Rothemund, Paul W. K.; Adleman, Leonard (2002-04-19). "Solution of a 20-Variable 3-SAT Problem on a DNA Computer". Science. 296 (5567): 499–502. Bibcode:2002Sci...296..499B. doi:10.1126/science.1069528. ISSN 0036-8075. PMID 11896237.
  12. ^ Primality testing algorithms [after Adleman, Rumely and Williams], volume 901 of Lecture Notes in Mathematics. Springer Berlin. 1981.
  13. ^ "NAE Website - DNA Computing by Self-Assembly". www.nae.edu. Retrieved 2015-11-24.
  14. ^ Cohen, Fred (1984), Computer Viruses – Theory and Experiments
  15. ^ "Adleman, Leonard - USC Viterbi Department of Computer Science". www.cs.usc.edu. Archived from the original on 2017-08-22. Retrieved 2017-08-22.
  16. ^ "Book of Members, 1780-2010: Chapter A" (PDF). American Academy of Arts and Sciences. Retrieved 6 April 2011.
  17. ^ "ACM Names 71 Fellows for Computing Advances that are Driving Innovation". Association for Computing Machinery. January 19, 2022. Retrieved 2022-01-19.

External links[edit]

Wikimedia Commons has media related to Leonard Adleman.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Leonard_Adleman&oldid=1230971410"