A computer algorithm can absolutely be non deterministic, pick your language and run random.rand()
There is a whole class of such algorithms https://en.wikipedia.org/wiki/Nondeterministic_Turing_machine
But I don't see how it makes a difference, even deterministic algorithms can produce infinite complexity, eg linear neural networks are proven to be able to compute any computable function, or the Mandelbrot set which is produced from a single recurrent statement but encodes a space of infinite complexity
Maybe your point is to say that a brain is performing a non computable function...but since your brain is computing that function..is that a counter example?