Desktop OSes just assume the vertical subtiles (at best with an option between RGB and BGR). TVs and mobile devices don't generally support subpixel rendering at all.
I've never seen this before, it's like a modern 2600 - deeply technical, scattered topics and depth, all very hacker-curious - and beautifully designed to boot.
Fun fact - the computiles piece is an uncredited rediscovery of Wang's work from the 1960's on computable tilings. Specifically, he went as far to show that the halting problem is equivalent to the 'domino problem' - can we tile the plane using a given finite set of dominoes (aka tiles) where we have infinitely many copies of each and the tiling must preserve edge-meet criteria. Every tiling is a computer program, every computer program is a tiling.
What do you mean? It's just simple beginner's examples in C. Should be easy enough to understand, C is famously very simple ('portable assembler' as they say!).
`Baby Steps in C` is hilarious lol. I'll be buying the print editions going forward. They hooked me right in with that.
That article triggered me to send it to my friends. C be crazy.
It reminds me a little bit of a Phrack textfile, but if Phrack had raster image art advertising in it.
What you've described is the printed version of Phrack!
I like page 30: The Subpixel Zoo. It must be hell for text rendering:
https://en.wikipedia.org/wiki/Subpixel_rendering
Desktop OSes just assume the vertical subtiles (at best with an option between RGB and BGR). TVs and mobile devices don't generally support subpixel rendering at all.
Sorry, we moved this. It's on page 37 now - "Hardware" section works better for this one than "Food for thought".
https://pagedout.institute/webview.php?issue=9&page=37&artic...
I've never seen this before, it's like a modern 2600 - deeply technical, scattered topics and depth, all very hacker-curious - and beautifully designed to boot.
For those interested, anyone can write a (one-page) article:
https://pagedout.institute/?page=cfp.php
Fun fact - the computiles piece is an uncredited rediscovery of Wang's work from the 1960's on computable tilings. Specifically, he went as far to show that the halting problem is equivalent to the 'domino problem' - can we tile the plane using a given finite set of dominoes (aka tiles) where we have infinitely many copies of each and the tiling must preserve edge-meet criteria. Every tiling is a computer program, every computer program is a tiling.
It’s credited in section 3
Michał Zalewski's article on page 42 is very funny.
Would someone be interested in explaining what in the world is going on in that article?
What do you mean? It's just simple beginner's examples in C. Should be easy enough to understand, C is famously very simple ('portable assembler' as they say!).
The anime avatar twitter people have finally created something beautiful.
Ahaha thank you for this comment, it's peak internet meme culture. Made my day :D
My fav zine