The Church/Turing thesis states that languages or functions computable by Turing machines are the same as languages or functions computable by algorithms.