# Is the AE Turing capable?

In the section Note G and the calculation of Bernoulli numbers it is argued that the AE as designed at that time could not enumerate the Bernoulli numbers, at least not with the program given in the table of Note G and without register indexing.

However, it is evident that the AE can easily simulate a Register or Minsky machine, which is proven to be equivalent to a Turing machine.

Bernouilli numbers, however, clearly fall into the category of computable numbers.

Thus an explanation is required to solve this apparent contradiction.