yego.me
💡 Stop wasting time. Read Youtube instead of watch. Download Chrome Extension

Walter Isaacson on Alan Turing, Intelligent Machines and "The Imitation Game" | Big Think


2m read
·Nov 4, 2024

Processing might take a few minutes. Refresh later.

It’s great to trace things back to Alan Turing. You know he’s in Bletchley Park, England. He had come up with the concept of the universal computing machine, but then he has to help put it in practice to break the German wartime code. So he comes up with a device called the bomb and then colossus, and these are machines that can break the code. He starts thinking about the difference between human imagination and machine intelligence.

And it goes back to what he calls Lady Lovelace’s objection. It goes back to Ada Lovelace a hundred years earlier who had said machines will be able to do everything except think. And so Turing comes up with what he calls the imitation game. Now we call it the Turing test, in which he tries to figure out how would you tell the difference between a human and a machine. How would you know the machine’s not intelligent?

He says, well, put a human and a machine in a different room, we send them questions, and if after a while you can’t tell which one’s a machine and which one’s a human, then it makes no sense to say the machine isn’t thinking. Now you can have philosophical arguments about whether or not that’s a good test, but ever since then, it’s been about 65 years since he came up with that concept. We’ve been trying to invent machines that would pass the Turing test or the imitation game.

Every now and then you read about a machine that can sort of do conversational gambits and maybe confuse a person for five minutes or so, and sort of try to pass the Turing test. But surprisingly, we found it very difficult to have machines that can really carry on a conversation and be confused with a human. You can usually tell the machine from the human.

A different way of looking at the way the computer age evolved is sort of Ada Lovelace’s way, which is that computers and humans will evolve symbiotically. They’ll be partners. We will get more intimately connected to our machines, and the machines will amplify our intelligence. Our creativity will amplify what the machines could do.

And we don’t need to try to create robots that’ll work without us. It’s kind of cooler to create this partnership of humans and technology, or as she put it, the humanities and engineering. So those are really the two schools of thought in computer programming.

And every now and then you hear people say the singularity’s coming or we’re about to get to the age of artificial intelligence and machine learning. And I suspect it may come, but it’s always about 20 years away. And in the meantime, it’s sort of the Ada Lovelace vision rather than the Alan Turing vision. The vision of having machines that connect to us more intimately rather than replace us and don’t need us anymore...

More Articles

View All
Does the president's party usually gain or lose seats at the midterm elections? | Khan Academy
Does the president’s party usually gain or lose seats at the midterm elections? It’s a pretty strong historical trend that the president’s party loses seats in the presidency. So, that’s particularly the case in the House of Representatives. Since the Ci…
15 Ways to Safe Guard Sudden Wealth
So you just sold your business, sold some land for 100x what you paid for, inherited a lot of money, retired rich, or won the lottery. Now what? Need a game plan, my friend? And by the end of this video, you’ll not only know the most effective ways to nev…
10 Stocks the Smart Money is Buying Now! (Q3 2021)
So spoken about Buffett’s 13F and monitor Prabria selling Alibaba and Michael Burry ditching his options bets. But one thing I like to do at the end of 13F season is have a look at Data Roamer, which tracks 73 super investors, and just check out what stoc…
Treating systems (the easy way) | Forces and Newton's laws of motion | Physics | Khan Academy
So in the previous video, we solved this problem the hard way. Maybe you watched it, maybe you didn’t. Maybe you just skipped right to here and you’re like, “I don’t even want to know the hard way. Just show me the easy way, please.” Well, that’s what we’…
Worked example: recognizing function from Taylor series | Series | AP Calculus BC | Khan Academy
So we’re given this expression: Is the Taylor series about zero for which of the following functions? They give us some choices here, so let’s just think a little bit about this series that they gave us. If we were to expand it out, let’s see. When n is …
Multivariable maxima and minima
When you have a multi-variable function, something that takes in multiple different input values, and let’s say it’s just outputting a single number. A very common thing you want to do with an animal like this is maximize it. Maximize it, and what this me…