シャドーイング練習: Turing & The Halting Problem - Computerphile - 動画で英語スピーキングを学ぶ
練習モードを選ぶ
各モードは全画面の練習ルームで開きます。
81 文
文が短すぎたり長すぎる場合は、Editをタップして調整してください。
1
Today we're going to be talking about a problem in logic, and how in solving that problem,
2
Alan Turing almost inadvertently invented the modern digital computer.
3
So we start back at the beginning of the 20th century, where mathematicians had posed this problem.
4
- Thank you.
5
In logic, we're interested in finding, do these premises entail this conclusion?
6
So premises are the bits you start off with in an argument.
7
They are the bits you know at the beginning or your assumptions.
8
And the conclusion is the bit you want to establish, the bit that you reason to with your argument.
9
And we want to know, is there a test that will tell us, yes, for sure, these premises do or don't entail this conclusion?
10
Is there an automatic way of finding out whether they do or whether they don't. So that's the problem.
11
It's called the decision problem.
12
and mathematicians wanted to find out Is there an answer to the decision problem for first order logic?
13
That's the kind of logic you learn in philosophy or mathematics at university.
14
So lots of mathematicians were trying to work out, is first order logic decidable?
15
That is, can we automatically test whether the premises entail the conclusion?
16
Alan Shuring was one of the first to discover that first order logic isn't decidable.
17
I To prove this, It's really difficult conceptually,
18
because you have to be able to show no possible program can give you the answer.
19
But how do you do that?
20
How do you show something about every possible program?
21
You can't run through every program one by one.
22
But Turing came up with a brilliant solution.
23
Yeah.
24
His idea goes something like this.
25
Suppose we have a program and let's just draw it as a black box.
26
It's going to take some inputs, and it's going to give us some outputs.
27
our program is going to solve some problem.
28
a problem like, do the premises entail the conclusion?
29
We ask it a question and it will give us an answer: yes, or no?
30
Now here's another question we can ask: Thank you.
31
Let's look at all of those possible programs.
32
And we're just thinking of them as black boxes at the moment.
33
We might want to know, is this program Given a certain input, gonna give us an answer.
34
Or is it going to trundle on forever and never give us an answer?
35
That is, is it going to halt or is it not going to halt eventually?
36
So think about your computer running.
37
You want it to give you an answer.
38
And whether it's a good answer or a bad answer, it's better than no answer.
39
No answer would mean the computer trundles round forever and ever in a loop.
40
And you would just never know whether it's going to finish today, tomorrow or never.
41
So halting is good.
42
So there's another question we can ask: Given some program and some inputs, will it ever halt?
43
Now it turns out that our logical problem Do these premises entail this conclusion?
44
is very similar to this halting problem.
45
In fact, if we can solve the logical problem, then we can solve the halting problem.
46
Will this program halt on this input?
47
So the clever part of Turing's proof is to show that it's impossible for any machine, however clever it is, to solve the halting problem.
48
That is to tell us whether a given machine with a given input will halt or not.
49
And here's how we did it.
50
Let's suppose we've got a machine or a program that solves the problem for us it solves the holding problem.
51
Don't worry about how it works, let's just think of it as a black box, taking a description of a machine and an input, and giving us an answer.
52
Yes it will halt or no it won't halt.
53
Just suppose that's possible.
54
Call that machine H for the halting problem.
55
If you give me that machine, I can transform it into a different machine like this.
56
I stick some extra bits on it so that If it gives me a yes answer, I make it loop forever without ever stopping.
57
If it gives me a no answer on the other hand, it's gonna halt straight away.
58
Let's call that big machine the whole thing.
59
H plus.
60
Now here's another question we can ask: what happens if I feed the whole machine into itself.
61
So I'm going to put H plus Thank you in here and H + in here.
62
So the question I'm now asking is, I'm feeding H + into itself.
63
So I'm asking the question: Does H + halt?
64
give an input H+.
65
And here's where it all goes wrong.
66
because If H + does halt, We get a yes answer.
67
But then it loops forever, so it doesn't halt.
68
On the other hand, if it doesn't halt, We get a no answer, but then it halts.
69
So if it does halt, then it doesn't halt.
70
But if it doesn't halt, then it does halt.
71
Either way, we get a contradiction.
72
It's a paradox.
73
And what that shows is we started off assuming that we can solve the problem.
74
we've ended up with a paradox.
75
So our assumption was bad.
76
It turns out there's no possible machine, no possible program that solves the halting problem.
77
The really clever bit about Turing's idea is it doesn't matter what kind of program or machine it is.
78
It doesn't matter whether it's An abstract algorithm, whether it's a real computer, a physical computer, it doesn't matter what it is.
79
We've proved that no such program is possible.
80
you Turing, as part of his argument, had to say a little bit about what's going on in these black boxes.
81
And the idea is that every card represents an instruction in this Turing machine.
アプリをダウンロード
流暢に話すために必要なすべて
AI発音採点文ごとに採点
IPA練習すべての音をマスター
単語学習自分の単語帳を作る
単語ゲーム遊びながら覚える
同じチャンネル
FOR YOU
おすすめ動画
このレッスンの語彙とスピーキングのポイント
この動画には、シャドーイング用の文が81文、単語が976語あります。 音声の長さは6:14です。 話す速さは1分あたり約157語で、日常会話に近い自然なペースです。 単語の83%は英語の頻出3,000語に含まれます。残りは練習の前に確認しておきましょう。
この動画の重要語彙
動画に出てくる覚えておきたい単語15語を、発音と意味つきで紹介します。
| 単語 | 発音 | 意味 |
|---|---|---|
| hungry 形容詞 | /ˈhʌŋ.ɡɹi/ | 空腹な, 飢えた |
| solve 動詞 | /sɒlv/ | 解決する |
| conclusion 名詞 | /kənˈkluːʒən/ | 終わり, 結び |
| premise 名詞 | /ˈpɹɛm.ɪs/ | 前提 |
| loop 名詞 | /luːp/ | ループ |
| clever 形容詞 | /ˈklɛv.ɚ/ | 巧い |
| paradox 名詞 | /ˈpæ.ɹəˌdɒks/ | 矛盾, パラドックス |
| output 名詞 | /ˈaʊtpʊt/ | 出力 |
| discover 動詞 | /dɪˈskʌvə/ | 発見する, 見つける |
| automatic 形容詞 | /ˌɔː.təˈmæt.ɪk/ | 自動の, 自動的な |
| mathematics 名詞 | /mæθ(.ə)ˈmæt.ɪks/ | 数学 |
| abstract 名詞 | /ˈæbˌstɹækt/ | 概要, 要約 |
| instruction 名詞 | /ɪnˈstɹʌkʃən/ | 指示 |
| transform 動詞 | /tɹænsˈfɔɹm/ | 変形する, 変換する |
| algorithm 名詞 | /ˈælɡəɹɪðm̩/ | アルゴリズム, 演算手順 |
動画に出てくる句動詞
| 単語 | 意味 |
|---|---|
| find out 動詞 | 見出す, 調べる |
注意したい発音
話し手はdoesn't, I'm, don'tなど、短縮形や弱形を25回使っています。聞こえたとおりの短い形で発音しましょう。
- 「th」の音: mathematics /mæθ(.ə)ˈmæt.ɪks/, algorithm /ˈælɡəɹɪðm̩/, mathematician /ˌmæθ.(ə.)məˈtɪʃ.ən/
- 「sh」と「zh」の音: conclusion /kənˈkluːʒən/, assumption /əˈsʌm(p).ʃ(ə)n/, establish /ɪˈstæb.lɪʃ/, instruction /ɪnˈstɹʌkʃən/, mathematician /ˌmæθ.(ə.)məˈtɪʃ.ən/
- 長い単語(アクセントの位置に注意): automatic /ˌɔː.təˈmæt.ɪk/, mathematics /mæθ(.ə)ˈmæt.ɪks/, mathematician /ˌmæθ.(ə.)məˈtɪʃ.ən/, decidable [dɪˈsaɪdəbəɫ], conceptually /kənˈsɛp.tjʊə.li/
この動画での練習方法
- まず声を出さずに動画を最後まで聞き、知らない単語をメモします。
- まず0.75倍速で一文ずつシャドーイングし、慣れてきたら通常の速度に戻します。
- 自分の声を録音して元の音声と比べます。hungry, solve, conclusionなどの単語に特に注意しましょう。
シャドーイングとは?英語上達に効果的な理由
シャドーイング(Shadowing)は、もともとプロの通訳者養成プログラムで開発された言語学習法で、多言語習得者として知られるDr. Alexander Arguelles によって広く普及されました。方法はシンプルですが非常に効果的:ネイティブスピーカーの英語を聞きながら、1〜2秒の遅延で声に出してすぐに繰り返す——まるで「影(shadow)」のように話者を追いかけます。文法ドリルや受動的なリスニングと異なり、シャドーイングは脳と口の筋肉が同時にリアルタイムで英語を処理・再現することを強制します。研究により、発音精度、抑揚、リズム、連音、リスニング力、そして会話の流暢さが大幅に向上することが確認されています。IELTSスピーキング対策や自然な英語コミュニケーションを目指す方に特におすすめです。













