meta_pixel
Tapesearch Logo
Log in
Nature Podcast

Nature Podcast: 28 January 2016

Nature Podcast

podcast@nature.com

News, Science, Technology

4.5893 Ratings

🗓️ 27 January 2016

⏱️ 23 minutes

🧾️ Download transcript

Summary

This week, the computer that can play Go, a general ‘ageing’ factor, and the stolen library of John Dee.

Hosted on Acast. See acast.com/privacy for more information.

Transcript

Click on a timestamp to play from that location

0:00.0

This week, the computer that learnt to play Go.

0:07.0

Everyone in deep mind was crowded into a room, brimming with excitement, watching AlphaGo's

0:12.0

internal evaluation go up and up and up as it started to believe it was winning.

0:16.0

And researchers watch 100,000 worms live and die.

0:19.0

I think this is possibly the single best lifespan experiment ever conducted.

0:25.2

Plus, the Lost Library of Tudor Scholar John D.

0:28.6

This is the Nature podcast for January the 28th, 2016.

0:32.5

I'm Adam Levy.

0:33.8

And I'm Kerry Smith.

0:45.2

Fun and games with artificial intelligence first this week.

0:48.4

A computer has learned to play the ancient game of Go.

0:49.9

Lizzie Gibney reports.

0:52.5

Computers beat humans at lots of things.

1:12.0

Crunching numbers, remembering long lists, tasks that require a lot of processing power or memory, but not a lot of creativity. In looking for bigger challenges, developers of artificial intelligence have often turned to games. Games need long-term planning, predictive power and cunning, in addition to all the processing power that computers have in spades. Chess was perhaps the most famous one to fall.

1:17.1

Chess Grandmaster Gary Kasparov lost a deep blue way back in 1997.

1:22.4

David Silver, from Google-owned company Deep Mind, explains.

1:25.8

Most board games were actually relatively straightforward for AIs to actually defeat humans

1:30.4

because they could basically use brute force search.

1:33.3

Brute Force search, basically combing through all the moves,

1:37.1

imagining the game several turns ahead and choosing the best play.

1:40.7

So say your AI is playing chess.

1:42.7

Black chooses his move and White considers all the possible follow-ups and black considers all the follow-ups to that.

...

Please login to see the full transcript.

Disclaimer: The podcast and artwork embedded on this page are from podcast@nature.com, and are the property of its owner and not affiliated with or endorsed by Tapesearch.

Generated transcripts are the property of podcast@nature.com and are distributed freely under the Fair Use doctrine. Transcripts generated by Tapesearch are not guaranteed to be accurate.

Copyright © Tapesearch 2026.