One thing you could do is to apply von Neumann de-biasing to convert a
string of output bits from your biased PRNG to an unbiased string, and
test the de-biased output. If such tests pass I don't know that you
can be satisfied thaty your biased PRNG is close to a theorieical
biased random bit
Peter Otten 在 2022年12月8日 星期四清晨5:17:59 [UTC+8] 的信中寫道：
> On 07/12/2022 03:23, Jach Feng wrote:
> > s0 = r'\x0a'
> > At this moment it was done by
> >
> > def to1byte(matchobj):
> > return chr(int('0x' + matchobj.group(1), 16))
> > s1 = re.sub(r'\\x([0-9a-fA-F]{2})', to1byte, s0)
> >
> >
Roel Schroeven 在 2022年12月7日 星期三下午4:42:48 [UTC+8] 的信中寫道：
> Op 7/12/2022 om 4:37 schreef Jach Feng:
> > MRAB 在 2022年12月7日 星期三上午11:04:43 [UTC+8] 的信中寫道：
> > > On 2022-12-07 02:23, Jach Feng wrote:
> > > > s0 = r'\x0a'
> > > > At this moment it was done by
> > > >
> > > > def to1byte(matchobj):
>
On 12/7/22 2:37 PM, David Lowry-Duda wrote:
On Wed, Dec 07, 2022 at 03:28:47PM -0300, Sabrina Almodóvar wrote:
As far as I know, the state-of-the-art in statistical tests against
PRNGs is the TestU01 library, available at
http://simul.iro.umontreal.ca/testu01/tu01.html
I'm familiar with
El 6/12/2022 a las 9:32 p. m., Dennis Lee Bieber escribió:
On Tue, 6 Dec 2022 20:42:42 +0100, ^Bart
declaimed the following:
I tried the written Python code but it needs to insert a username and
password so it's a different service than TFTP but maybe there's also a
code to do it in Python!
On Wed, Dec 07, 2022 at 03:28:47PM -0300, Sabrina Almodóvar wrote:
As far as I know, the state-of-the-art in statistical tests against
PRNGs is the TestU01 library, available at
http://simul.iro.umontreal.ca/testu01/tu01.html
I'm familiar with this type of test. But as far as I can tell and
> On 7 Dec 2022, at 16:49, ^Bart wrote:
>
>
>> It's a whole different protocol. TFTP is simplified to the point it
>> will fit on embedded devices which don't need security (the assumption
>> being that one has the embedded device physically present, FTP assumes
>> distributed networks).
On 07/12/2022 03:23, Jach Feng wrote:
s0 = r'\x0a'
At this moment it was done by
def to1byte(matchobj):
return chr(int('0x' + matchobj.group(1), 16))
s1 = re.sub(r'\\x([0-9a-fA-F]{2})', to1byte, s0)
But, is it that difficult on doing this simple thing?
>>> import codecs
On 07/12/2022 13:45, Stefan Ram wrote:
[...]
> |One of the oldest interpretations is the /limit frequency/
> |interpretation. If the conditioning event /C/ can lead
> |to either A or "not A", and if in /n/ repetitions of such
> |a situation the event A occurs /m/ times, then it is asserted
>
On 07/12/2022 14:04, Stefan Ram wrote:
> r...@zedat.fu-berlin.de (Stefan Ram) writes:
>> So, in this case, careful code reviews might be better than
>> tests. For example, assuming, random.intrange( 0, 2 ) works
>> as advertised, we can be pretty sure that
>> 0 if random.randint( 0, 2 ) else 1
>>
On 2022-12-07, Dennis Lee Bieber wrote:
> It's a whole different protocol. TFTP is simplified to the point it
> will fit on embedded devices which don't need security (the
> assumption being that one has the embedded device physically
> present, FTP assumes distributed networks).
One of the big
I use asyncio in a couple of places. Haven’t quite grokked it yet, though.
From: Python-list on
behalf of Stefan Ram
Date: Wednesday, December 7, 2022 at 12:28 PM
To: python-list@python.org
Subject: Re: on the python paradox
*** Attention: This is an external email. Use caution responding,
On 07/12/2022 13:05, David Lowry-Duda wrote:
> Inspired by the recent thread about pseudorandom number generators on
> python-ideas (where I also mistakenly first wrote this message), I began
> to wonder: suppose that I had a pseudorandom number generator that
> attempted to generate a nonuniform
It's a whole different protocol. TFTP is simplified to the point it
will fit on embedded devices which don't need security (the assumption
being that one has the embedded device physically present, FTP assumes
distributed networks).
https://wiki.python.org/moin/tftp
I never used TFTP
The Python code you showed was implementing an FTP server. That's a
completely different protocol from TFTP. There are TFTP
implementations for Pythong. This one works well:
https://github.com/msoulier/tftpy
I didn't know the difference of FTP and TFTP so... I thought TFTP was
just a FTP
Thomas Passin 在 2022年12月7日 星期三中午12:51:32 [UTC+8] 的信中寫道：
> On 12/6/2022 9:23 PM, Jach Feng wrote:
> > s0 = r'\x0a'
> > At this moment it was done by
> >
> > def to1byte(matchobj):
> > return chr(int('0x' + matchobj.group(1), 16))
> > s1 = re.sub(r'\\x([0-9a-fA-F]{2})', to1byte, s0)
> >
Hi there
I might shortly be posting about a specific issue with imaplib/poplib,
but, thought would first introduce myself.
I am 100% blind, but, among other forms of assistive technology
software, I use windows PC's with the NVDA screenreader, which itself is
written in python, but,
On Mon, Dec 05, 2022 at 10:37:39PM -0300, Sabrina Almodóvar wrote:
The Python Paradox
Paul Graham
August 2004
[SNIP]
Hence what, for lack of a better name, I'll call the Python paradox:
if a company chooses to
Inspired by the recent thread about pseudorandom number generators on
python-ideas (where I also mistakenly first wrote this message), I began
to wonder: suppose that I had a pseudorandom number generator that
attempted to generate a nonuniform distribution. Suppose for instance
that it was to
Op 7/12/2022 om 4:37 schreef Jach Feng:
MRAB 在 2022年12月7日 星期三上午11:04:43 [UTC+8] 的信中寫道：
> On 2022-12-07 02:23, Jach Feng wrote:
> > s0 = r'\x0a'
> > At this moment it was done by
> >
> > def to1byte(matchobj):
> > return chr(int('0x' + matchobj.group(1), 16))
> > s1 =
20 matches
Mail list logo
