ycliper

Популярное

Музыка Кино и Анимация Автомобили Животные Спорт Путешествия Игры Юмор

Интересные видео

2025 Сериалы Трейлеры Новости Как сделать Видеоуроки Diy своими руками

Топ запросов

смотреть а4 schoolboy runaway турецкий сериал смотреть мультфильмы эдисон
Скачать

Professor Avi Wigderson on the "P vs. NP" problem

Автор: ETH Zürich

Загружено: 2012-05-14

Просмотров: 47702

Описание: Avi Wigderson is a professor of Mathematics at the Institute for Advanced Study in Princeton. After studying Computer Science at Technion in Haifa, he obtained his PhD in 1983 from Princeton University. He held then various visiting positions including IBM Research at San Jose, MSRI Berkeley, and IAS Princeton. From 1986 to 2003 he was associate professor at the Hebrew University in Jerusalem. Wigderson has been for two decades a leading figure in the field of Mathematics of Computer Science, with fundamental contributions, in particular in Complexity Theory, Randomness, and Cryptography. He has been invited speaker at ICM in Tokyo (1990), and Zurich (1994), and plenary speaker in Madrid (2006). Among many awards he received both the Nevanlinna Prize (1994), and the Gödel Prize (2009).

This lecture about efficient computation, internet security, and the limits to human knowledge was hold on 7 May 2012 at ETH Zurich, when Avi Wigderson was invited as guest speaker of the Wolfgang Pauli Lectures. The Wolfgang Pauli Lectures are an annual lecture series that is devoted alternately to physics, mathematics and biology. They are named after the great theoretical physicist and Nobel laureate Wolfgang Pauli, who was professor at ETH Zurich from 1928 until his death in 1958.

Не удается загрузить Youtube-плеер. Проверьте блокировку Youtube в вашей сети.
Повторяем попытку...
Professor Avi Wigderson on the "P vs. NP" problem

Поделиться в:

Доступные форматы для скачивания:

Скачать видео

  • Информация по загрузке:

Скачать аудио

Похожие видео

Professor Avi Wigderson on a computational theory of randomness

Professor Avi Wigderson on a computational theory of randomness

Professor Avi Wigderson on cryptography

Professor Avi Wigderson on cryptography

Beyond Computation: The P versus NP question

Beyond Computation: The P versus NP question

Доказательство с нулевым разглашением (с Ави Вигдерсоном) — Numberphile

Доказательство с нулевым разглашением (с Ави Вигдерсоном) — Numberphile

The 30th Hintze Lecture – Prof Sir Roger Penrose and Prof Janna Levin: 'A Universe of Black Holes'’

The 30th Hintze Lecture – Prof Sir Roger Penrose and Prof Janna Levin: 'A Universe of Black Holes'’

Самая большая головоломка в информатике: P против NP

Самая большая головоломка в информатике: P против NP

Проблема P=?NP – задача тысячелетия – Даниил Мусатов

Проблема P=?NP – задача тысячелетия – Даниил Мусатов

Ави Вигдерсон: Случайность и псевдослучайность

Ави Вигдерсон: Случайность и псевдослучайность

Beyond Computation: The P vs NP Problem - Michael Sipser

Beyond Computation: The P vs NP Problem - Michael Sipser

What if you just keep squaring?

What if you just keep squaring?

What Computers Can't Do - with Kevin Buzzard

What Computers Can't Do - with Kevin Buzzard

Donald Knuth: P=NP | AI Podcast Clips

Donald Knuth: P=NP | AI Podcast Clips

Прилёты по резиденции Путина и Зеленский с Трампом | Бодрая концовка 2025-го (English subtitles)

Прилёты по резиденции Путина и Зеленский с Трампом | Бодрая концовка 2025-го (English subtitles)

Professor Dr. Sir Roger Penrose on new clues to the basics of conscious mentality

Professor Dr. Sir Roger Penrose on new clues to the basics of conscious mentality

Scott Aaronson

Scott Aaronson "On the Nature of Proof"

Prof. Scott Aaronson - Quantum Computing and the Limits of the Efficiently Computable

Prof. Scott Aaronson - Quantum Computing and the Limits of the Efficiently Computable

P=NP?

P=NP?

Beyond Computation: The P versus NP question (panel discussion)

Beyond Computation: The P versus NP question (panel discussion)

Proof complexity - an introduction - Avi Wigderson

Proof complexity - an introduction - Avi Wigderson

The Secret Link Between Thousands of Unsolved Math Problems (NP-Completeness)

The Secret Link Between Thousands of Unsolved Math Problems (NP-Completeness)

© 2025 ycliper. Все права защищены.



  • Контакты
  • О нас
  • Политика конфиденциальности



Контакты для правообладателей: [email protected]