Prática de Shadowing: Turing & The Halting Problem - Computerphile - Aprenda a falar inglês com vídeo

Escolha um modo de prática

Cada modo abre uma sala de prática em tela cheia.

81 frases
Se as frases estiverem muito curtas ou longas, clique em Edit para ajustá-las.
1
Today we're going to be talking about a problem in logic, and how in solving that problem,
Hoje vamos falar sobre um problema de lógica e como, ao resolver esse problema,
2
Alan Turing almost inadvertently invented the modern digital computer.
Alan Turing inventou quase por acidente o computador digital moderno.
3
So we start back at the beginning of the 20th century, where mathematicians had posed this problem.
Então, voltamos ao início do século 20, quando os matemáticos haviam proposto esse problema.
4
- Thank you.
- Obrigado.
5
In logic, we're interested in finding, do these premises entail this conclusion?
Na lógica, temos interesse em descobrir se essas premissas implicam essa conclusão.
6
So premises are the bits you start off with in an argument.
Então, premissas são os pontos de partida de um argumento.
7
They are the bits you know at the beginning or your assumptions.
Eles são os dados que você conhece no início ou as suas premissas.
8
And the conclusion is the bit you want to establish, the bit that you reason to with your argument.
E a conclusão é a parte que você quer estabelecer, a parte à qual você chega por meio do seu raciocínio com o argumento.
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?
E queremos saber: existe um teste que nos diga, sim, com certeza, se essas premissas implicam ou não essa conclusão?
10
Is there an automatic way of finding out whether they do or whether they don't. So that's the problem.
Existe uma maneira automática de descobrir se eles fazem ou se não fazem. Então esse é o problema.
11
It's called the decision problem.
É chamado de problema de decisão.
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.

Baixar aplicativo

Tudo o que você precisa para falar fluentemente

Pronúncia com IANota em cada frase
Prática de IPADomine cada som
VocabulárioMonte seu banco de palavras
Jogo de vocabulárioAprenda brincando

Mesmo canal

FOR YOU

Vídeo recomendado

Vocabulário e dicas de fala para esta lição

Este vídeo tem 81 frases e 976 palavras para praticar shadowing. A fala dura 6:14. O falante fala em ritmo natural, cerca de 157 palavras por minuto, próximo de uma conversa do dia a dia. 83% das palavras estão entre as 3.000 mais comuns do inglês; vale a pena estudar o restante antes de começar.

Vocabulário principal deste vídeo

15 palavras do vídeo que vale a pena aprender, com pronúncia e significado:

PalavraPronúnciaSignificado
hungry adjetivo/ˈhʌŋ.ɡɹi/faminto, com fome
solve verbo/sɒlv/resolver, solucionar
conclusion substantivo/kənˈkluːʒən/conclusão
premise substantivo/ˈpɹɛm.ɪs/premissa
loop substantivo/luːp/laço
clever adjetivo/ˈklɛv.ɚ/hábil, talentoso
logical adjetivo/ˈlɑd͡ʒɪkəl/lógico
assumption substantivo/əˈsʌm(p).ʃ(ə)n/suposição, pressuposição
paradox substantivo/ˈpæ.ɹəˌdɒks/paradoxo
establish verbo/ɪˈstæb.lɪʃ/firmar, instaurar
output substantivo/ˈaʊtpʊt/produção
discover verbo/dɪˈskʌvə/descobrir
automatic adjetivo/ˌɔː.təˈmæt.ɪk/automático
mathematics substantivo/mæθ(.ə)ˈmæt.ɪks/matemática
abstract substantivo/ˈæbˌstɹækt/resumo, sumário

Phrasal verbs que você vai ouvir

PalavraPronúnciaSignificado
find out verbodescobrir
turn out verboterminar
come up with verbopensar (em), alcançar
work out verbo/ˌwɝk ˈaʊt/calcular

Pronúncia para ficar de olho

O falante usa 25 contrações e formas reduzidas, como doesn't, I'm, don't. Diga-as na forma curta, do jeito que você ouve.

  • Os sons de “th”: mathematics /mæθ(.ə)ˈmæt.ɪks/, algorithm /ˈælɡəɹɪðm̩/, mathematician /ˌmæθ.(ə.)məˈtɪʃ.ən/
  • Os sons de “sh” e “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/
  • Palavras longas — acerte a sílaba tônica: 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/

Como praticar com este vídeo

  1. Ouça o vídeo inteiro uma vez sem falar e anote as palavras que você não conhece.
  2. Comece na velocidade 0,75×, faça shadowing frase por frase e volte à velocidade normal quando ficar fácil.
  3. Grave a sua voz e compare com o original, prestando atenção a palavras como hungry, solve, conclusion.

O que é a Técnica de Shadowing?

Shadowing é uma técnica de aprendizado de idiomas com base científica, originalmente desenvolvida para o treinamento de intérpretes profissionais. O método é simples, mas poderoso: você ouve áudio em inglês nativo e repete imediatamente em voz alta — como uma sombra seguindo o falante com 1-2 segundos de atraso. Pesquisas mostram melhora significativa na precisão da pronúncia, entonação, ritmo, sons conectados, compreensão auditiva e fluência na fala.

Técnica de shadowing: leia o guia completo passo a passo →