Загрузка страницы
Все видеоНовые видеоПопулярные видеоКатегории видео

Adleman: Inventing DNA Computing

Leonard M. Adleman, winner of the Association for Computing Machinery's A.M. Turing Award, recounts his invention of the concept of DNA computing - coding DNA sequences to construct a molecular computing device. This clip is taken from an interview conducted with Adelman by Hugh Williams for the ACM on August 18, 2016. Video of the full interview is available as part of Liskov’s ACM profile at https://amturing.acm.org/award_winners/adleman_7308544.cfm.

Видео Adleman: Inventing DNA Computing канала Turing Awardee Clips
Показать
Комментарии отсутствуют
Введите заголовок:

Введите адрес ссылки:

Введите адрес видео с YouTube:

Зарегистрируйтесь или войдите с
Информация о видео
16 мая 2020 г. 5:10:50
00:05:21
Turing Awardee Clips
Правообладателям
Жалоба
Комментарии
Другие видео канала
Corbato on the beginning of timesharing with CTSS.Corbato on the beginning of timesharing with CTSS.Emerson on the adoption of model checking and the state explosion problem.Emerson on the adoption of model checking and the state explosion problem.Sifakis defines model checkingSifakis defines model checkingHellman on his Ph.D. ("Learning with Finite Memory")Hellman on his Ph.D. ("Learning with Finite Memory")Valiant on the discovery of P#-completenessValiant on the discovery of P#-completenessDiffie: Countercultural Attraction to EncryptionDiffie: Countercultural Attraction to EncryptionMicali on how a Sicilian childhood made him a cryptographer.Micali on how a Sicilian childhood made him a cryptographer.Stearns on his first exposure to computers and computer scienceStearns on his first exposure to computers and computer scienceSifakis on Verimag and "correctness by construction."Sifakis on Verimag and "correctness by construction."Valiant on his 1983 paper "A Theory of the Learnable"Valiant on his 1983 paper "A Theory of the Learnable"Stonebraker: Commercializing INGRESStonebraker: Commercializing INGRESKarp on the probabilistic analysis of algorithmic complexity.Karp on the probabilistic analysis of algorithmic complexity.Cook on “The Complexity of Theorem-Proving Procedures“Cook on “The Complexity of Theorem-Proving Procedures“Goldwasser on Kilian, Schoof and primalityGoldwasser on Kilian, Schoof and primalityKahn on writing the ARPANET proposalKahn on writing the ARPANET proposalKarp on his shift to computational biology.Karp on his shift to computational biology.Kahan on creating IEEE Standard Floating PointKahan on creating IEEE Standard Floating PointFeigenbaum on editing Computers and ThoughtFeigenbaum on editing Computers and ThoughtKnuth on not writing compilers for a livingKnuth on not writing compilers for a livingValiant on the Bulk Synchronous ModelValiant on the Bulk Synchronous ModelKarp on the definition of P and NP.Karp on the definition of P and NP.
Статистика портала
Яндекс.Метрика
© 2008-2024 «Информационно-развлекательный портал города Верхняя Салда»
| Карта портала | Реклама | Контакты | Сообщить об ошибке | Соглашения
salda.ws salda.ws@mail.ru
Сейчас на сайте: 512 Статистика портала