Can Algorithms Think? | Richard Karp and Lex Fridman

preview_player
Показать описание
(more links below)

Podcast full episodes playlist:

Podcasts clips playlist:

Podcast website:

Podcast on Apple Podcasts (iTunes):

Podcast on Spotify:

Podcast RSS:

Richard Karp is a professor at Berkeley and one of the most important figures in the history of theoretical computer science. In 1985, he received the Turing Award for his research in the theory of algorithms, including the development of the Edmonds–Karp algorithm for solving the maximum flow problem on networks, Hopcroft–Karp algorithm for finding maximum cardinality matchings in bipartite graphs, and his landmark paper in complexity theory called "Reducibility Among Combinatorial Problems", in which he proved 21 problems to be NP-complete. This paper was probably the most important catalyst in the explosion of interest in the study of NP-completeness and the P vs NP problem.

Subscribe to this YouTube channel or connect on:
Рекомендации по теме
Комментарии
Автор

To achieve better AI machines we will need first to integrate multiple areas of knowledge working together. Unfortunately we don't learn or teach this way.

ICantFindPeaceOfMind
Автор

Did you watch the football game, real football when technology f%ck something that was seen by all, and kicked off 200.000.000 million pounds from one subject to another.
I M talking about Sheffild _Aston Villa. Av is maybe a little more traditional eng club from the bigger cities but it is not the reason for stay in premiere leauge. This is also a great opportunity for learning.. Machines do not have morality and honesty, they just calculate faster and it is not morale to put AI in all industries. Medicine ok, but in army it will finished first, bcz human are greed to much and capitalism is system which force them to be, it calculate success with the points or money if u r not 1. U r forgotten, l wish l was wrong.

Andre-ffhp