The distinction between constructively defined algorithms and algorithms whose existence is provable in ZFC inspires theorems and open problems that concern decidable sets X⊆N and cannot be formalized in mathematics understood as an a priori science as they refer to the current knowledge on X
HAL (Le Centre pour la Communication Scientifique Directe)