The 'whostyle' is a way of styling syndicated hypertext from other writers. This could be a quoted excerpt or a complete article. A feed reader could use a 'whostyle' to show a post without stripping all of its layout.
I decided to make a truly naked, brutalist html page, that is itself a quine. And this page is it.
Viewing the source of this page should reveal a page identical to the page you are now seeing. Nothing is hidden. It's a true "What you see is what you get."
Throughout the talk I discuss the mental models we construct in tech, the cognitive dissonance we experience when confronted with new ideas, specifically about CSS.
We know CSS has a separate mental model because we keep hearing the same debate rage on: “Is CSS broken or awesome?” This talk is about enabling teams to communicate and accommodate these different mental models. I share examples of effective tools, and how they change the way designers and developers interact.
On one side, an army of developers whose interests, responsibilities, and skill sets are heavily revolved around JavaScript.
On the other, an army of developers whose interests, responsibilities, and skill sets are focused on other areas of the front end, like HTML, CSS, design, interaction, patterns, accessibility, etc.
Wang tiles (Hao Wang, 1961) are a class of formal systems. They are modelled visually by square tiles with a color on each side. A set of such tiles is selected, and copies of the tiles are arranged side by side with matching colors, without rotating or reflecting them.
The basic question about a set of Wang tiles is whether it can tile the plane or not, i.e., whether an entire infinite plane can be filled this way. The next question is whether this can be done in a periodic pattern.
In 1966, Wang's student Robert Berger solved the problem in the negative. He proved that no algorithm for the problem can exist, by showing how to translate any Turing machine into a set of Wang tiles that tiles the plane if and only if the Turing machine does not halt. The undecidability of the halting problem then implies the undecidability of Wang's tiling problem.