Skip to main content

The pseudo-random number generators in Commodore and Apple microcomputers

Abstract

In this paper the pseudo-random number generators which are implemented in the widely used Commondore and Apple microcomputers are discussed. The results of this investigation show that these generators are not useful for scientific work. In particular short periods appear in the sequences of the generated pseudo-random numbers.

This is a preview of subscription content, access via your institution.

References

  • Dieter, U., Ahrens, J. H. (1974): Uniform Random Numbers, Institut f. Math. Stat., Techn. Univ. Graz, Graz (Austria).

    Google Scholar 

  • Donahue, C. S., Enger, J. K. (1980): PET-CBM Personal Computer Guide, Osborne/McGraw-Hill, Berkeley (Cal.), USA.

    Google Scholar 

  • Knuth, D. E. (1981): The Art of Computer Programming, Vol. 2, 2d ed., Addison-Wesley, Reading (Mass.), Menlo Park (Cal.), London, Amsterdam, Don Mills (Ont.), Sydney.

    MATH  Google Scholar 

  • Schmitz, N., Lehmann, F. (1976): Monte-Carlo-Methoden I, Hain, Meisenheim/Glan.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Afflerbach, L. The pseudo-random number generators in Commodore and Apple microcomputers. Statistische Hefte 26, 321–333 (1985). https://doi.org/10.1007/BF02932542

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02932542

Keywords

  • Floating Point
  • Memory Address
  • Linear Congruential Generator
  • Commodore Program
  • Commodore Computer