William Kahan
 William Kahan | |
|---|---|
 | |
| Rayuwa | |
| Haihuwa | Toronto, 5 ga Yuni, 1933 (92 shekaru) |
| ƙasa | Kanada |
| Karatu | |
| Makaranta |
University of Toronto (en)  |
| Thesis director |
Byron Alexander Griffith (en) |
| Dalibin daktanci |
James Demmel (en) Deb Kumar Nag Chowdhury (mul) Jerome Toby Coonen (mul) Pingtak Peter Tang (mul) Ren-Cang Li (mul) Scott B. Baden (mul) |
| Sana'a | |
| Sana'a |
masanin lissafi, computer scientist (en) da university teacher (en) |
| Employers |
University of California, Berkeley (en) Adalia Ltd. (en) |
| Muhimman ayyuka |
IEEE 754 (en) Davis-Kahan Theorem (en) |
| Kyaututtuka |
gani
|
| Mamba |
American Academy of Arts and Sciences (en) ACM (mul) |
| cs.berkeley.edu… | |
William "Velvel" Morton Kahan (an haife shi a ranar 5 ga Yuni, 1933) masanin lissafi ne na Kanada kuma masanin kimiyyar kwamfuta, wanda farfesa ne a Jami'ar California, Berkeley . Ya sami lambar yabo ta Turing a shekarar 1989 don "babban gudummawarsa ga nazarin lambobi".[1]
Tarihin rayuwa
[gyara sashe | gyara masomin]An haife shi ne a cikin iyalin Yahudawa na Kanada, [1] ya halarci Jami'ar Toronto, inda ya sami digiri na farko a shekara ta 1954, digiri na biyu a shekara ta 1956, da Ph.D. a shekara ta 1958, duk a fagen lissafi. Kahan yanzu farfesa ne na ilmin lissafi da injiniyan lantarki da kimiyyar kwamfuta (EECS) a Jami'ar California, Berkeley .
Kahan shine babban masanin gine-gine a bayan ma'auni na IEEE 754-1985 don lissafin ma'aunin ruwa (da kuma bin sa mai zaman kansa, IEEE 854). An kira shi "Uba na Floating Point", tun lokacin da ya taimaka wajen kirkirar asalin IEEE 754 specification.[1] Kahan ya ci gaba da gudummawarsa ga sake fasalin IEEE 754 wanda ya haifar da ma'auni na IEEE 754.
A cikin shekarun 1980s ya haɓaka shirin "paranoia", alamar da ke gwadawa don nau'ikan kwari masu tasowa.[1] Ya kuma haɓaka algorithm na tarawa na Kahan, wani muhimmin algorithm don rage kuskuren da aka gabatar yayin ƙara jerin lambobi masu tasowa masu iyaka. Ya kirkiro kalmar "Table-maker's dilemma" don farashin da ba a sani ba na daidaita ayyukan da suka wuce daidai ga wasu lambobi da aka riga aka sanya.[2]
Davis-Kahan-Weinberger dilation theorem yana daya daga cikin alamun sakamako a cikin ka'idar dilation na masu aiki da sararin samaniya na Hilbert kuma ya sami aikace-aikace a wurare daban-daban.[2]
Shi mai ba da shawara ne game da ingantaccen ilimi na yawan lissafin lissafi game da batutuwan da ke iyo kuma a kai a kai yana sukar yanke shawara a cikin ƙirar kwamfutoci da harsunan shirye-shirye waɗanda ya yi imanin za su lalata ƙididdigar da ke iyo.[3][4][5]
Lokacin da Hewlett-Packard (HP) ya gabatar da lissafin kimiyya na aljihu na HP-35, daidaitattun lambobi a kimanta ayyukan da suka fi dacewa don wasu muhawara ba su da kyau. HP ta yi aiki sosai tare da Kahan don inganta daidaito na algorithms, wanda ya haifar da manyan ci gaba. An rubuta wannan a lokacin a cikin Hewlett-Packard Journal . [6][7] Ya kuma ba da gudummawa sosai ga ƙirar algorithms a cikin Jerin HP Voyager kuma ya rubuta wani ɓangare na matsakaici da kuma ingantaccen jagororin su.
An kira Kahan Fellow na ACM a cikin 1994, kuma an shigar da shi cikin Kwalejin Injiniya ta Kasa a cikin 2005. [1]
Dubi kuma
[gyara sashe | gyara masomin]- Intel 8087
Manazarta
[gyara sashe | gyara masomin]- ↑ 1.0 1.1 1.2 1.3 Haigh, Thomas (1989). "William ("Velvel") Morton Kahan". A. M. Turing Award. Retrieved 2017-05-27.
- ↑ Empty citation (help)
- ↑ Kahan, William (1 March 1998). "How Java's Floating-Point Hurts Everyone Everywhere" (PDF). Retrieved 1 March 2021.
- ↑ Haigh, Thomas (March 2016). "An interview with William M. Kahan" (PDF). Retrieved 1 March 2021.
- ↑ Empty citation (help)
- ↑ Empty citation (help)
- ↑ Kahan, William. "A Logarithm Too Clever by Half". Retrieved 2008-11-14.