Does deterministic imply algorithmic?
An algorithm must have a finite description, whereas a deterministic process according to your definition can use an infinite lookup table. For example there is a deterministic process that solves the halting problem for Turing machines, but there is no such algorithm.