math.answers.com/other-math/Can_a_computer_produce_a_list_of_random_numbers

Preview meta tags from the math.answers.com website.

Linked Hostnames

8

Thumbnail

Search Engine Appearance

Google

https://math.answers.com/other-math/Can_a_computer_produce_a_list_of_random_numbers

Can a computer produce a list of random numbers? - Answers

Most computers generate pseudo-random numbers - these are numbers which are created using a formula, but due to the way the formula works, the sequence of numbers generated appears random and is good enough for most applications. The random number generator can be seeded so that the same sequence of "random" numbers is generated every time. Some systems improve on this by using unpredictable "real-world" events to create a more truly random sequence: The Apple ][ computer when waiting for a key press from the user would keep incrementing the current "seed"; thus the seed was influenced by the random event of the user pressing a key but if a series of "random" numbers was then taken, they were strictly pseudo-random. Linux has a pseudo-random number generator in a library function, but it also has in the kernel itself an "entropy pool" which is filled by environmental "noise" created by device drivers, etc. By accessing /dev/random a series of numbers is created from this pool; if the pool empties then the device will block until more "Noise" has been collected. /dev/urandom acts similarly, except that if the pool empties, then it falls back onto a pseudo-random sequence. As the entropy pool is limited in size, the random values being read should be used where security is important, eg in creating the key for an encryption, in small doses.



Bing

Can a computer produce a list of random numbers? - Answers

https://math.answers.com/other-math/Can_a_computer_produce_a_list_of_random_numbers

Most computers generate pseudo-random numbers - these are numbers which are created using a formula, but due to the way the formula works, the sequence of numbers generated appears random and is good enough for most applications. The random number generator can be seeded so that the same sequence of "random" numbers is generated every time. Some systems improve on this by using unpredictable "real-world" events to create a more truly random sequence: The Apple ][ computer when waiting for a key press from the user would keep incrementing the current "seed"; thus the seed was influenced by the random event of the user pressing a key but if a series of "random" numbers was then taken, they were strictly pseudo-random. Linux has a pseudo-random number generator in a library function, but it also has in the kernel itself an "entropy pool" which is filled by environmental "noise" created by device drivers, etc. By accessing /dev/random a series of numbers is created from this pool; if the pool empties then the device will block until more "Noise" has been collected. /dev/urandom acts similarly, except that if the pool empties, then it falls back onto a pseudo-random sequence. As the entropy pool is limited in size, the random values being read should be used where security is important, eg in creating the key for an encryption, in small doses.



DuckDuckGo

https://math.answers.com/other-math/Can_a_computer_produce_a_list_of_random_numbers

Can a computer produce a list of random numbers? - Answers

Most computers generate pseudo-random numbers - these are numbers which are created using a formula, but due to the way the formula works, the sequence of numbers generated appears random and is good enough for most applications. The random number generator can be seeded so that the same sequence of "random" numbers is generated every time. Some systems improve on this by using unpredictable "real-world" events to create a more truly random sequence: The Apple ][ computer when waiting for a key press from the user would keep incrementing the current "seed"; thus the seed was influenced by the random event of the user pressing a key but if a series of "random" numbers was then taken, they were strictly pseudo-random. Linux has a pseudo-random number generator in a library function, but it also has in the kernel itself an "entropy pool" which is filled by environmental "noise" created by device drivers, etc. By accessing /dev/random a series of numbers is created from this pool; if the pool empties then the device will block until more "Noise" has been collected. /dev/urandom acts similarly, except that if the pool empties, then it falls back onto a pseudo-random sequence. As the entropy pool is limited in size, the random values being read should be used where security is important, eg in creating the key for an encryption, in small doses.

  • General Meta Tags

    22
    • title
      Can a computer produce a list of random numbers? - Answers
    • charset
      utf-8
    • Content-Type
      text/html; charset=utf-8
    • viewport
      minimum-scale=1, initial-scale=1, width=device-width, shrink-to-fit=no
    • X-UA-Compatible
      IE=edge,chrome=1
  • Open Graph Meta Tags

    7
    • og:image
      https://st.answers.com/html_test_assets/Answers_Blue.jpeg
    • og:image:width
      900
    • og:image:height
      900
    • og:site_name
      Answers
    • og:description
      Most computers generate pseudo-random numbers - these are numbers which are created using a formula, but due to the way the formula works, the sequence of numbers generated appears random and is good enough for most applications. The random number generator can be seeded so that the same sequence of "random" numbers is generated every time. Some systems improve on this by using unpredictable "real-world" events to create a more truly random sequence: The Apple ][ computer when waiting for a key press from the user would keep incrementing the current "seed"; thus the seed was influenced by the random event of the user pressing a key but if a series of "random" numbers was then taken, they were strictly pseudo-random. Linux has a pseudo-random number generator in a library function, but it also has in the kernel itself an "entropy pool" which is filled by environmental "noise" created by device drivers, etc. By accessing /dev/random a series of numbers is created from this pool; if the pool empties then the device will block until more "Noise" has been collected. /dev/urandom acts similarly, except that if the pool empties, then it falls back onto a pseudo-random sequence. As the entropy pool is limited in size, the random values being read should be used where security is important, eg in creating the key for an encryption, in small doses.
  • Twitter Meta Tags

    1
    • twitter:card
      summary_large_image
  • Link Tags

    16
    • alternate
      https://www.answers.com/feed.rss
    • apple-touch-icon
      /icons/180x180.png
    • canonical
      https://math.answers.com/other-math/Can_a_computer_produce_a_list_of_random_numbers
    • icon
      /favicon.svg
    • icon
      /icons/16x16.png

Links

58