Canal-U

Mon compte
Université Paris 1 Panthéon-Sorbonne

Computers are Not Omnipotent


David Harel here shows a commercial as an example that is not included in the lecture caption. 

If you want to see it go to this link:

http://www.dailymotion.com/video/x11q3t_voiture-sous-la-neige_fun

David Harel here shows a commercial as an example that is not included in the lecture caption.

If you want to see it go to this link:

https://youtu.be/osU_pHjYGUY

David Harel here shows a commercial as an example that is not included in the lecture caption.

If you want to see it go to this link:

https://youtu.be/SFHmlMZFfvI

Copier le code pour partager la vidéo :
<div style="position:relative;padding-bottom:56.25%;padding-top:10px;height:0;overflow:hidden;"><iframe src="https://www.canal-u.tv/video/universite_paris_1_pantheon_sorbonne/embed.1/computers_are_not_omnipotent.17720?width=100%&amp;height=100%" style="position:absolute;top:0;left:0;width:100%;height: 100%;" width="550" height="306" frameborder="0" allowfullscreen scrolling="no"></iframe></div> Si vous souhaitez partager une séquence, indiquez le début de celle-ci , et copiez le code : h m s
Auteur(s) :
HAREL David

Producteur Canal-U :
Université Paris 1 Panthéon-Sorbonne
Contacter le contributeur
J’aime
Imprimer
partager facebook twitter Google +

Computers are Not Omnipotent

In 1984, TIME magazine quoted the chief editor of a certain software publication as saying: "Put the right kind of software into a computer, and it will do whatever you want it to. There may be limits on what you can do with the machines themselves, but there are no limits on what you can do with software."
This talk will survey results obtained over the last 80 years by mathematicians, logicians and computer scientists, which disprove this ignorance-based statement in a sweeping and fundamental way. We shall discuss problems that are provably non-computable, as well as ones that are hopelessly time- or memory-consuming (requiring far more time than has elapsed since the Big Bang, or requiring a computer would not fit into the entire known universe). Time permitting, we will also take a somewhat more amusing look at these facts, and relate them to the (im)possibilities of true artificial intelligence. The topic is very closely linked to some of Alan M. Turing’s most important work.

  •  
  •  
    Date de réalisation : 11 Mars 2015
    Durée du programme : 72 min
    Classification Dewey : Computer Science, Médias numériques (sociologie)
  •  
    Catégorie : Conférences
    Niveau : Tous publics / hors niveau
    Disciplines : Sciences de l'information et de la communication
    Collections : Professeurs invités à Paris I
    ficheLom : Voir la fiche LOM
  •  
    Auteur(s) : HAREL David
    producteur : Université Paris I Panthéon-Sorbonne
  •  
    Langue : Anglais
    Mots-clés : computer
 

commentaires


Ajouter un commentaire Lire les commentaires
*Les champs suivis d’un astérisque sont obligatoires.
Aucun commentaire sur cette vidéo pour le moment (les commentaires font l’objet d’une modération)
 

Dans la même collection

FMSH
 
Facebook Twitter Google+
Mon Compte