Advertisement

Statistische Hefte

, Volume 26, Issue 1, pp 321–333 | Cite as

The pseudo-random number generators in Commodore and Apple microcomputers

  • Lothar Afflerbach
Algorithms

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.

Keywords

Floating Point Memory Address Linear Congruential Generator Commodore Program Commodore Computer 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dieter, U., Ahrens, J. H. (1974): Uniform Random Numbers, Institut f. Math. Stat., Techn. Univ. Graz, Graz (Austria).Google Scholar
  2. Donahue, C. S., Enger, J. K. (1980): PET-CBM Personal Computer Guide, Osborne/McGraw-Hill, Berkeley (Cal.), USA.Google Scholar
  3. 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.zbMATHGoogle Scholar
  4. Schmitz, N., Lehmann, F. (1976): Monte-Carlo-Methoden I, Hain, Meisenheim/Glan.zbMATHGoogle Scholar

Copyright information

© Springer-Verlag 1985

Authors and Affiliations

  • Lothar Afflerbach
    • 1
  1. 1.Fachbereich MathematikTechnische Hochschule DarmstadtDarmstadt

Personalised recommendations