-1
$\begingroup$

I would like to have one or more examples of a PRNG that is computable by a Turing machine, has no period, and preferably is cryptographically secure.

New contributor
Lennart is a new contributor to this site. Take care in asking for clarification, commenting, and answering. Check out our Code of Conduct.
$\endgroup$
  • $\begingroup$ What do you mean by "given infinite memory" in you title ? $\endgroup$ – William Hird Apr 15 at 18:21
  • $\begingroup$ Also, wasn't this question asked on SE Computer Science ? $\endgroup$ – William Hird Apr 15 at 18:48
  • $\begingroup$ cs.stackexchange.com/q/18250/755 $\endgroup$ – D.W. Apr 16 at 7:12
  • $\begingroup$ What do you mean by cryptographically secure? Usual definitions of PRNG in cryptography a priori assume that the image is bounded, hence are not applicable to your concept. $\endgroup$ – Emil Jeřábek Apr 16 at 11:27

Your Answer

Lennart is a new contributor. Be nice, and check out our Code of Conduct.

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.