  We construct a theory definitionally equivalent to first-order Peano
arithmetic PA and a non-standard computable model of this theory. The same
technique allows us to construct a theory definitionally equivalent to
Zermelo-Fraenkel set theory ZF that has a computable model.
