<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://replica.wiki.extremist.software/index.php?action=history&amp;feed=atom&amp;title=Randomness</id>
	<title>Randomness - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://replica.wiki.extremist.software/index.php?action=history&amp;feed=atom&amp;title=Randomness"/>
	<link rel="alternate" type="text/html" href="https://replica.wiki.extremist.software/index.php?title=Randomness&amp;action=history"/>
	<updated>2026-04-04T15:36:46Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.39.13</generator>
	<entry>
		<id>https://replica.wiki.extremist.software/index.php?title=Randomness&amp;diff=46230&amp;oldid=prev</id>
		<title>Danf: some random notes, quotes, &amp; code</title>
		<link rel="alternate" type="text/html" href="https://replica.wiki.extremist.software/index.php?title=Randomness&amp;diff=46230&amp;oldid=prev"/>
		<updated>2015-01-07T20:44:19Z</updated>

		<summary type="html">&lt;p&gt;some random notes, quotes, &amp;amp; code&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&amp;#039;&amp;#039;some random notes, quotes, &amp;amp; code&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
[https://en.wikipedia.org/wiki/Randomness Wikipedia]&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Although randomness had often been viewed as an obstacle and a nuisance for many&lt;br /&gt;
centuries, in the twentieth century computer scientists began to realize that&lt;br /&gt;
the deliberate introduction of randomness into computations can be an effective&lt;br /&gt;
tool for designing better algorithms.&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
* [https://en.wikipedia.org/wiki/Algorithmically_random_sequence Algorithmic Randomness]&lt;br /&gt;
* [https://en.wikipedia.org/wiki/Algorithmic_information_theory Algorithmic Information Theory]&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Unlike classical information theory, algorithmic information theory gives formal,&lt;br /&gt;
rigorous definitions of a random string and a random infinite sequence that do not&lt;br /&gt;
depend on physical or philosophical intuitions about nondeterminism or likelihood.&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
-----&lt;br /&gt;
&lt;br /&gt;
[https://docs.python.org/2/library/random.html Python]&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Python uses the Mersenne Twister as the core generator. It produces&lt;br /&gt;
53-bit precision floats and has a period of 2**19937-1 [...] However,&lt;br /&gt;
being completely deterministic, it is not suitable for all purposes,&lt;br /&gt;
and is completely unsuitable for cryptographic purposes.&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
(Mersenne Twister replaced Wichmann-Hill as default generator in Python 2.3)&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
The random module also provides the SystemRandom class which uses the&lt;br /&gt;
system function os.urandom() to generate random numbers from sources&lt;br /&gt;
provided by the operating system.&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
example:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
import random&lt;br /&gt;
&lt;br /&gt;
foo = random.getrandbits(1024) # mersenne twister, returns arbitrarily long integer&lt;br /&gt;
print(bin(foo))&lt;br /&gt;
&lt;br /&gt;
altrand = random.SystemRandom() # not available on all systems, assumes entropy source&lt;br /&gt;
&lt;br /&gt;
bar = altrand.getrandbits(1024)&lt;br /&gt;
print(bin(bar))&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:Math]]&lt;/div&gt;</summary>
		<author><name>Danf</name></author>
	</entry>
</feed>