The thesis can be stated as: Every effectively calculable function is a computable function.[16] Church also stated that "No computational procedure will be considered as an algorithm unless it can be represented as a Turing Machine".[citation needed] Turing stated it this way: