David Kenyon
2
APPEARANCES
2
PODCASTS
012
DEC 30
JAN 6
JAN 13
JAN 20
JAN 27
FEB 3
FEB 10
FEB 17
FEB 24
MAR 3
MAR 10
MAR 17
MAR 24
MAR 31
APR 7
APR 14
APR 21
APR 28
MAY 5
MAY 12
MAY 19
MAY 26
JUN 2
JUN 9
JUN 16
JUN 23
JUN 30
JUL 7
JUL 14
JUL 21
JUL 28
AUG 4
AUG 11
AUG 18
AUG 25
SEP 1
SEP 8
SEP 15
SEP 22
SEP 29
OCT 6
OCT 13
OCT 20
OCT 27
NOV 3
NOV 10
NOV 17
NOV 24
DEC 1
DEC 8
DEC 15
DEC 22
DEC 29
JAN 5
JAN 12
JAN 19
JAN 26
FEB 2
FEB 9
FEB 16
FEB 23
MAR 2
MAR 9
MAR 16
MAR 23
MAR 30
APR 6
APR 13
APR 20
APR 27
MAY 4
MAY 11
MAY 18
MAY 25
JUN 1
JUN 8
JUN 15
JUN 22
JUN 29
JUL 6
JUL 13
JUL 20
JUL 27
AUG 3
AUG 10
AUG 17
AUG 24
AUG 31
SEP 7
SEP 14
SEP 21
SEP 28
Jun 26, 2026
E192 - From Warsaw to Hemel Hempstead
27:15
27:33
27:39
27:46

David KenyonGUEST
How do they fit into this story? They arrive in August, and the radio intelligence company has been established a few months earlier.

David KenyonGUEST
They arrive and they join the exploitation platoon, which was the code-breaking setup.

David KenyonGUEST
And one of the people who's come over with them is Lieutenant Shakhno, who takes over running the exploitation platoon.

David KenyonGUEST
So the various people who've come with Brzezinski and Zhigalski are folded into the operation of Boxmoor.
17 MINS LATER
Alan Turing: life of the week
17:58
18:10
18:17
18:29
18:35
18:43
S
17:49Spencer MizenHOST
I'm thinking here, for example, of Turing's proof, the famous Turing machine, and although this was a little bit later, the Turing pattern.

David KenyonGUEST
Well, the really important moment is in 1935 when, as a, as a fellow, he writes with Max Newman, who was at Cambridge at the time and was sort of his mentor in mathematics.

David KenyonGUEST
He started working onThe Entscheidungsproblem in German, which translates as the decidability problem.

David KenyonGUEST
And this is a concept in mathematics where the question is whether it is possible that all things in maths can be resolved, that you can write an algorithm that would, would give you the answer to any problem.

David KenyonGUEST
And some mathematicians had argued that actually maths is fundamentally unprovable on some levels.

David KenyonGUEST
There are some aspects of mathematics that while they appear to be true, you could never rigorously demonstrate them using logic.

David KenyonGUEST
And Turing addressed this problem in a paper called On Computable Numbers, which was published in 1936.
14 MINS LATER
