@ParadeGrotesque 70320,357 was me. #BrainWorm
#Octal
@ParadeGrotesque 70320,357 was me. #BrainWorm
#Octal
Fun fact, today's #UnixDate is an #octal #palindrome
$ printf '%04o\n' $(( $(date +%s) / 86400 ))
47074
Cómo expresar enteros en #binario, #octal y #hexadecimal en C++ / #Cpp.
Acá te explico cómo se hace.
Has anyone ever written a "color theory for #octal programmers"?
I want something like Hacker's Delight meets Paul Klee
But, on the other hand, DO use the #octal encoding that you gave.
It's vis(1) encoding, and used (say) in #FreeBSD's fstab(5) so that no field contains whitespace & the file can thus be reliably processed with conventional text processing tools like awk.
This is not the case for fstab(5) on systems that don't apply unvis(3) decoding; where awk either gets the fields wrong when there's whitespace or gets stymied by quoting systems that don't match how awk understands flat files.
There are 10 kinds of people.
Czech Czech, won (1), too (10), free (11), fofum (100, 101), i smell the blood of an Englishman.
Yeah, 10 kinds 😜
clOCkTAL: For When Reading A Clock Is Just Too Easy
Over on Hackaday.io, [danjovic] presents clOCkTAL, a simple LED clock for those of us who struggle with the very concept of making it easy to read the time. Move aside binary clocks, you're easy , let's talk binary coded octal. Yes, it is a thing. We'll leave it to [danjovic] to describe how to read the time from it:
Do not try to do the math using 6 bits. The trick to read this clock is to read every 3-bit digit in binary and multiply the MSBs by 8 before summing to the LSBs.
Simple. If you're awake enough, that is. Anyway, we're a big fan of the stripped-down raw build method using perf board, and scrap wood. No details hidden here. The circuit is straightforward, being based on a minimal configuration needed to drive the PIC16F688 and a handful of LEDs arranged in a 3×4 matrix.
An interesting detail is the use of Bresenham's Algorithm to derive the one event-per-second needed to keep track of time. And no, this isn't the more famous Bresenham's line algorithm you may be more familiar with, it's much simpler, but does work on the same principle of replacing expensive arithmetic division operations with incremental errors. The original Bresenham's Algorithm was devised for using with X-Y plotters, which had limited resolution, and was intended to allow movements that were in an imperfect ratio to that resolution. It was developed into a method for approximating lines, then extended to cover circles, ellipses and other types of drawables.
Bresenham's Algorithm allows you to create the event you want, with any period from any oscillator frequency, and this is very useful indeed. Now obviously you don't get something for nothing, and the downside is periodic jitter, but at least it is deterministic. The way it works is to alternate the period being counted between two power-of-two division ratios (or something easily created from that) such that the average period is what you want. Cycle-to-cycle there is an error, but overall these errors do not accumulate, and we get the desired average period. The example given in [Roman Black]'s description is to alternate 16 cycles and 24 cycles to get an average of 20 cycles.
The software side of things can be inspected by heading over to the clOCkTAL GitHub which makes use of the Small Device C Compiler which has support for a fair few devices, in case dear readers, you had not yet come across it.
The video shows the clock being put through a simple test demonstrating the LED dimming in response to ambient light. All-in-all a pretty simple and effective build.
#clockhacks #bresenham #ledmatrixdisplay #octal #pic16f #sdcc
The fact that #decimal sucks isn't controversial, but most of us don't know any other bases. Even worse, most folks who *are* comfortable with other bases are only comfortable with #hexadecimal (!) and #octal (!!), which are better than decimal but still suboptimal.
So what makes a good number base?
https://en.wikipedia.org/wiki/Highly_composite_number
That's fine, but are there any criteria for a *great* number base?
https://en.wikipedia.org/wiki/Superior_highly_composite_number
Arithmetic doesn't have to be hard, we're doing it to ourselves.
https://hostux.social/media/JmESeXsV6QlNSkMAkis
La SNCF a dû se tromper, la place 44 était déjà prise…