Leonard Adleman

Leonard Adleman (an haife shi a ranar 31 ga Disamba, 1945) masanin kimiyyar kwamfuta ne ɗan ƙasar Amurka. Yana ɗaya daga cikin waɗanda suka ƙirƙiri tsarin ɓoye bayanai na RSA, wanda ya sami kyautar Turing ta 2002.  name=":0"> An kuma san shi da ƙirƙirar fannin ƙirƙiro bayanai na DNA da kuma ƙirƙirar kalmar ƙwayar cuta ta kwamfuta . 

 Tarihin Rayuwa 
An haifi Leonard M. Adleman ga wani Bayahude  a California . Iyalinsa sun fara ƙaura zuwa Amurka daga Belarus ta zamani, daga yankin Minsk .  Ya girma a San Francisco kuma ya halarci Jami'ar California, Berkeley, inda ya sami digirinsa na BA a fannin lissafi a 1968 da digirinsa na PhD a EECS a 1976. "Leonard M. Adleman | American computer scientist". Encyclopædia Britannica. Retrieved 2015-11-24.  Shi ne kuma mai ba da shawara kan lissafi a fim ɗin Sneakers .  A 1996, ya zama memba na Kwalejin Injiniya ta Ƙasa  saboda gudummawar da ya bayar ga ka'idar lissafi da ɓoye bayanai. Shi ma memba ne na Kwalejin Kimiyya ta Ƙasa . 

Adleman kuma ɗan dambe ne mai son shiga gasar kuma ya yi wasa da James Toney . 

 Ganowa 
A shekarar 1994, takardarsa mai suna Molecular Computing of Solutions To Combinatorial Problems ta bayyana amfani da DNA a matsayin gwajin tsarin lissafi.  A ciki, ya warware wani misali mai lamba bakwai na matsalar Hamiltonian Graph, wata matsala mai lamba bakwai da ta yi kama da matsalar mai siyarwa mai tafiya . Duk da cewa mafita ga misalin mai lamba bakwai ba ta da mahimmanci, wannan takarda ita ce misali na farko da aka sani na nasarar amfani da DNA don ƙididdige algorithm . An nuna cewa lissafin DNA yana da damar a matsayin hanyar magance wasu manyan matsalolin bincike.  Ana kiran Adleman da sunan Uban Kwamfutar DNA. 

A shekara ta 2002, shi da ƙungiyar bincikensa sun sami nasarar magance wata matsala 'marar muhimmanci' ta amfani da lissafin DNA.  Musamman, sun magance matsalar SAT mai canzawa 20 wadda ke da sama da mafita miliyan 1. Sun yi ta kamar yadda Adleman ya yi amfani da ita a cikin takardarsa ta 1994. Da farko, an haɗa cakuda zaren DNA a hankali wanda ke wakiltar sararin warware matsalar. Daga nan aka yi amfani da wannan cakuda ta hanyar algorithm ta amfani da dabarun biochemical don fitar da zaren 'mara daidai', inda aka bar zaren kawai waɗanda suka 'gamsar' matsalar. Binciken jerin nucleotide na waɗannan zaren da suka rage ya nuna mafita 'masu kyau' ga matsalar ta asali. "Leonard M. Adleman | American computer scientist". Encyclopædia Britannica. Retrieved 2015-11-24.

Shi ne ɗaya daga cikin waɗanda suka gano gwajin farko na Adleman-Pomerance-Rumely .

Fred Cohen, a cikin takardarsa ta 1984, Experiments with Computer Viruses ya ambaci Adleman da ya ƙirƙiro kalmar " computer virus ". 

Tun daga shekarar 2017, Adleman yana aiki akan ka'idar lissafi ta Strata. Farfesa ne a fannin kimiyyar kwamfuta a Jami'ar Kudancin California.

 Kyaututtuka 
Saboda gudunmawar da ya bayar wajen ƙirƙirar tsarin RSA, Adleman, tare da Ron Rivest da Adi Shamir, sun sami kyautar Paris Kanellakis Theory and Practice Award ta 1996 da kuma kyautar Turing Award ta 2002, wadda aka fi sani da kyautar Nobel ta Kimiyyar Kwamfuta. "Leonard M. Adleman | American computer scientist". Encyclopædia Britannica. Retrieved 2015-11-24. An zaɓi Adleman a matsayin memba na Kwalejin Fasaha da Kimiyya ta Amurka a 2006  da kuma ACM Fellow na 2021. 

 Duba kuma 

 Jerin shahararrun masu shirye-shirye
 Jerin manyan masana kimiyyar kwamfuta

 Manazarta 

Rukuni:Rayayyun mutane
Rukuni:Haifaffun 1945