Tag Archives: Matijasevic’s theorem

Fibonacci numbers, 5

A small diversion before we come to the conclusion of this series. I am grateful to Robin Whitty for pointing this out to me. A set S of positive integers is recursively enumerable if there is a computer program which … Continue reading

Posted in exposition | Tagged , , | 2 Comments