Tag Archives: programming

The long-tail of tool design and transformative programming

Simon St. Laurent connects some conceptual components in Transformative Programming: Flow-based, functional, and more. He explains the connections between web services, punch cards, Unix pipes, functional programming, and flow-based programming. I have been thinking about these connections for some time, and I’m glad somebody articulated them.

After years of watching and wondering, I’m starting to see a critical mass of developers working within approaches that value loose connections. …they share an approach of applying encapsulation to transformations, rather than data.

I think that people want tools to solve problems. It is amazing to see the lengths that computer novices will go to get the wrong tools to do what they want. (I talked about this in my JSConf.eu talk this year. It isn’t on YouTube yet, so I have no idea how coherent I was.)

If we make it easier to stitch together minimal tools, then we could make our own environment for different kinds of tasks. Wire in a spreadsheet when we need tabular data, timeline when we have linear media, dataflow graph when we want to make A/V synthesis and filtering… building software should be the practice of recognizing how to stitch these components together.

More people should have this skill. My main research interest is in making this skill (really, superpower) more accessible. I want to do this for myself, but also for my parents, kids, friends, and myself as a 9-year-old.

Monolithic software suites try to solve every problem in a broad domain with a giant toolbox, and then get abused to solve problems in other domains. Photoshop isn’t a web design tool, and it isn’t a dynamic web/mobile app design tool, but it is bent to solve those problems. Toolboxes are useful things to have and understand, but every digital media challenge is different.

meemoo-illo-by-jyri-pieniniemi I think that the upcoming custom elements web standard + NoFlo is going to be a powerful combination to make tools to get stuff done. I agree with St. Laurent that making the high-level picture dataflow is an effective way to make this work. My Meemoo.org and Mozilla App Maker are two potentially-compatible concepts for building toy programs like this. NoFlo is bringing this method to general purpose JavaScript, which now includes many spheres of possibility: server, browser, audio, video, 3D.

At JSConf.eu Jason Frame demoed a prototype window manager made for slicing up a screen and stitching together tools like this, using dataflow wires to connect widgets. I imagine a system like that which can also zoom in (open up?) to make more complex logic in a NoFlo graph.

This is the long-tail of tool design. 5 billion people will come online for the first time in the next 10 years. What problems will they be interested in solving? How many of these problems will be too obscure or not profitable enough to be suitable for a company to attempt to solve?

Right now, today, we can’t see the thing, at all, that’s going to be the most important 100 years from now.
Carver Mead


St. Laurent also writes about “Humans as Transformers.” Lauren McCarthy made a project where she farmed out all decisions during some dates to strangers on the internet in real-time. This got me to imagine a “Mechanical Turk” component for NoFlo: inputs data, text for directions, and price per item processed; outputs the human-transformed data. You could run these in parallel to compare answers, and use NoFlo’s normal flow controls to handle the asynchronous nature of the component. This would be a quick and dirty way to encapsulate any programming challenge too complex or difficult to express in code.

COMP 401 == fun

I have been taking a Computer Science class this semester to hone my self-taught programming skills. I’m really glad that I decided to go through with it. It was nice to be back in the classroom, and the Prof, Dr. Stephen Weiss, made it quite enjoyable.

Dr. Weiss has been around for a large percentage of the entirety of Computer Science, and translates all of that experience into really cool lessons, asides, and tangents in the class. Before taking the class I had no idea how punch-card or tape-based systems would sort a large set of values (or do anything, for that matter). In teaching basic sort algorithms by relating them to historical systems like this, Dr. Weiss puts a more imaginable perspective on what is really going on behind the aluminum and gloss of my little lappy.

The kicker that tied this together came on Tuesday, when he described the Turing Machine, which is an incredibly simple theoretical machine, first described in 1936, that can do anything that any computer can do, from punch-card machine to MacBook Pro.

All of the assignments could be approached as puzzles, which made completing them particularly satisfying. I just finished the final assignment, a 9-square puzzle solver. You start with nine cards with values on each edge, then rearrange them, position and rotation, so that all the touching edges add up to 0. There are 49*9! (=95,126,814,720) possible arrangements, which, if you went through all of them, would take even a modern computer a while. So the problem is to eliminate possibilities as you go, which is called pruning. Here is the output of my solution: