How to describe the set of "all computable functions" using Coq?
The usual definition of partial recursive functions using Turing machines and classical logic (with a few novelties) has been implemented in Coq: see 

Zammit, Vincent (1997) A Proof of the S-m-n theorem in Coq. Technical report. University of Kent, The University of Kent, Canterbury, Kent, UK