jepler

17 ms·

121.
by jepler 4y ago
Thanks for the correction. You're right, current scientific thinking is that the sun is not capable of going "supernova".
122.
by jepler 4y ago
On the timescale from now until the sun goes nova, confident "no". Roughly speaking, the sun orbits the galactic center at a velocity of 220km/s. To fall into, or to be sucked into, the central black hole would require the lo
123.
by jepler 4y ago
I think you'll have to explain the joke.
124.
by jepler 4y ago
Not quite, EOF is not necessarily (-1) but some negative number.
125.
by jepler 4y ago
I don't feel the need to, umm, defend what some implementation with CHAR_BIT of 16 or 32 actually does, but I do notice that if sizeof(int) == 1, then I think that (unsigned char)EOF == UCHAR_MAX. I think that unless sizeof(int) > 1
126.
by jepler 4y ago
absolutely great advice! Another avenue that is more like "those days" are modern old-style computers like the Z80-based RC2014 ecosystem (I don't own one, but eye them monthly).
127.
by jepler 4y ago
So many things done on these computers seem "heroic" now, given how profligate we are in our use of memory by comparison. Write a compiler of any sort in 48kB of code+data? It sounds impossible today. Oh, and of course every milli
128.
by jepler 4y ago
I worked for an industry-specific 3D cad company at the time. We wanted to create some kind of web-enabled version of our software circa 2003-2005 (totally guessing at the time frame but seems right). It feels like every choice we made was
129.
by jepler 4y ago
Surely #define rand() abort() would be better for security.
130.
by jepler 5y ago
Careful, qsn is different than single quoted strings in sh.
131.
by jepler 5y ago
How does anyone learn anything? I'm no Bill Gates, but I am a college drop-out who makes a living writing software. I think there are a couple of things that came together for me: Access to computers for the purposes of programming (in
132.
by jepler 5y ago
Like others in the thread, I'm entranced by the idea. However, the lack of github links for the "open source" of this ASIC have put me right off of becoming a backer. It's a dang shame that we have to spend time & ef
133.
by jepler 5y ago
Can't you just pack the last byte with 1s, rather than having a whole extra byte?
134.
by jepler 5y ago
Nice!
135.
by jepler 5y ago
Like y'all, I wanted to see how I could do. Of course, I didn't get all the way to tested code on a gameboy. But it does compress & decompress in Python. I took the central idea of encoding deltas (or actually delta less 1, si
136.
by jepler 5y ago
The latter.
137.
by jepler 5y ago
Some commentary would have helped me. I don't read (or write) rust but my understanding: * an untyped, unchecked region of memory is modeled by `let mut mem = Vec::<char>::new();` * First, a fixed range of 16 bytes in m
138.
by jepler 5y ago
As far as I can tell, there's little to nothing objectionable about this change; it makes urandom behave _more like_ random, by not yielding bytes before the kernel's entropy pool is in a good state (GRND_INSECURE). Systems where
139.
Python Software Foundation hiring to improve PyPI(pyfound.blogspot.com)
7 points by jepler 5y ago|0 comments
140.
by jepler 5y ago
"We experienced an issue during today's flight that resulted in the payloads not being delivered to orbit. We are deeply sorry to our customers @NASA and the small satellite teams. More information will be provided after we comple
141.
by jepler 5y ago
"The Services are offered only to residents of the United States. The Services must be primarily used in the United States (territories not included) and are not intended for extended international use. Further, the Services are design
142.
by jepler 5y ago
Correct URL appears to be https://www.usenix.org/publications/loginonline/web3-fraud
143.
by jepler 5y ago
It's good to distinguish between general-recursive and tail-recursive functions. Tail-recursive functions can be transformed into code that uses a bounded amount of stack (no more than a single call worth). The latter kind of functions
144.
by jepler 5y ago
gmp uses a particular recurrence relation to exactly compute fib(x) in about log(x) steps[0]. Of course, the digits of the numbers it has to multiply also increase. It's fast-ish up to fib(128 million) or so but soon after that you ru
145.
by jepler 5y ago
That is to say, rewrite each sqrt(N_i) as P_i * sqrt(Q_i) where P and Q are integers and Q contains no squares. So 2 becomes 1 * sqrt(2), 4 becomes 2 * sqrt(1) and 8 becomes 2 * sqrt(2). Now, you can subtract equal terms from each side of
146.
by jepler 5y ago
Ah, I was puzzled by this at first too. What showed me the situation more clearly was clearing the cache _via the class object, not the instance_: >>> fnord = Fnord() >>> fnord.square(3) # lru_cache'd 9
147.
by jepler 5y ago
It's interesting to note that the algorithm can be rewritten with 2 nested loops instead of 3; for each z and x, check that there exists an integer y. At 10,000 triples found, this is the difference between (on my system) 700ms and 42
148.
by jepler 5y ago
> According to the sources, users would need to disable E-cores I don't know the specificis of these CPUs, but it seems likely that _a sane design_ could allow heterogeneous CPU features within a single machine. For example, let&#x2
149.
by jepler 5y ago
fork was one heck of a great mistake. fork gives you multiprocessing, in which you set up a computational environment then create copies of it as needed (e.g., up to the processor parallelism available) to do more work in less time, and wit
150.
by jepler 5y ago
https://en.wikipedia.org/wiki/Campaign_for_the_neologism_%22... "Santorum" may be an instructive example.

More ›