Wikipedia's biographical article on Leonard Adleman, an American computer scientist, co-inventor of the RSA algorithm, founder of DNA computing and 2002 Turing Award laureate. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
PublisherWikipedia
URLhttps://en.wikipedia.org/wiki/Leonard_Adleman
Source Typereference
Reliability Tier3
Sources
Leonard Adleman (Wikipedia)
WikipediaSelf-citation, publisher
Leonard Max 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. He is also known for the creation of the field of DNA computing and coining the term computer virus.
Self-citation, url
Leonard Max 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. He is also known for the creation of the field of DNA computing and coining the term computer virus.
Self-citation, source-type
Leonard Max 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. He is also known for the creation of the field of DNA computing and coining the term computer virus.
Self-citation, reliability-tier
Leonard Max 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. He is also known for the creation of the field of DNA computing and coining the term computer virus.
View the Source Claims Backed By This Source (16 claims)
This source backs 16 claims across the atlas. As facts: 11 well-attested. As cited relationships: 4 holds. Plus 1 entities citing it as a general reference with no single fact or relationship attached.
Disposition By Topic
- Scientists, 12 claims: 7 well-attested, 4 holds, 1 general references.
- Sources, 4 claims: 4 well-attested.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.