A 'Turing Complete' programming language can be used to solve any problem which is computable. Which of the following problems is not computable?

Determine all of the divisors of some number n.

Determine if a program will stop when given certain input.

Determine all the prime numbers less than some number n.

All of these problems are computable.

Determine which candidate won the election, given all the ballots.