Probably Dance

I can program and like games

Another explanation for the Fermi Paradox

I just finished a science fiction book (The Algebraist by Iain M. Banks) in which people travel through space, but there is no faster than light travel. That is except if there is a wormhole connecting the solar system that you’re in with where you want to go. If there isn’t, it will probably take hundreds of years to transport the other end of a wormhole to where you want to go.

The long travel times offer another explanation for the Fermi Paradox. (in addition to all the explanations already in that article) If you lived in a spaceship and heard that there might be a young civilization on a rocky planet somewhere that is just emerging out of their evolutionary phase, would you spend hundreds of years to have a look? (While knowing that that new species is probably pretty boring and that you’ve probably seen five other species like it before and you already don’t like hanging out with those all that much)

You probably wouldn’t. Nobody would. And the proof lies in the fact that there are still hundreds of uncontacted tribes around the world. (Wikipedia) Now that I’ve told you that there are hundreds of uncontacted tribes around the world, will you go out and try to contact them? Probably not. Too many reasons against it, too few reasons for it.

And in space everything takes a heck of a lot longer, so no wonder that nobody has bothered to say hi.

Ideas for a Programming Language Part 4: Reactive Programming

Reactive programming has been around for a long time. It’s a paradigm oriented around data flows. The usual example is a spreadsheet: If cell B refers to cell A, then cell B updates automatically when I change the value in cell A. If ten cells refer to cell A, then all those ten cells change automatically. This is as opposed to C++, where if I compute ten variables using variable X, then if I change variable X, I have to manually write code to make sure that the other ten variables get updated.

What’s changed recently is that there are a few interesting approaches that make this paradigm more widely useful. Functional Reactive Programming (FRP) is a useful approach which is spreading, with popular libraries available for pretty much all languages. For an illustration of FRP and how it can be used in an imperative style I recommend reading Deprecating the Observer Pattern.

What really convinced me though that a lot more code should be reactive is a javascript library called Knockout. Which makes it so easy to write reactive code, you’d be stupid to ever write manual state propagation code.

Read the rest of this entry »

On Self-Improving Intelligence

I just watched this TED talk by Nick Bostrom which is about what happens when computers get smarter than we are. It follows the theory that once we have created AI that is smarter than us, that AI will be able to create AI that is even smarter than itself. So at that point we’ll be left behind very quickly. Intelligence will develop a dynamic of self-improvement that can’t be stopped.

What he doesn’t realize is that we are already in that mode. We have already created people that are smarter than we used to be. And those people have created people who are smarter than themselves. That process has been going on for hundreds, if not thousands of years. The human brain is not the limit for human intelligence.

Read the rest of this entry »

Recommended Link: Inventing on Principle

This talk was influental recently but I feel like far more people should follow this advice. The philosophy part is good, but it’s really about the demos.

Read the rest of this entry »

Ideas for a Programming Language Part 3: No Shadow Worlds

This post is inspired by this text by Gilad Bracha. I recommend that you read it before reading this blog post. The idea of Shadow Worlds is that people keep inventing these constructs that are powerful enough that you want to use them as programming languages, but they are not powerful enough to have the features of high level programming languages that make programming enjoyable.

Before reading that blog post I knew that I wanted a macro system for my language. Looking at my old notes I had written down that a macro system is necessary, and that templates are not enough. However I wanted a type safe macro system from modern languages like Nim or Rust. Gilad Bracha’s blog post made me realize that you actually never want macros because they are just another Shadow World. Instead you want to do everything in your high level language.

Read the rest of this entry »

Recommended Link: Deprecating the Observer Pattern

A note about this post: I sometimes feel like I should have a Twitter account just to share random links, but I’d also like something more organized than Twitter. So I think I’ll just post short blog posts here every now and then which are basically just a link and a comment about the link. Let’s start with Deprecating the Observer Pattern:

One of my favourite papers. After you’ve read it here’s my comments:

Read the rest of this entry »

Ideas for a Programming Language Part 2: A more liberal call stack

One thing that came out of playing around with coroutines is that I eventually realized that callstacks are a bit annoying. It’s one of these things where it’s difficult to convince people because callstacks are equivalent in power to any other form of organizing your program flow. But I think that callstacks constantly force us into solving two puzzles: 1. How to split some sequential, blocking, code up into several smaller pieces of non-blocking code because the function has to return quickly. 2. Where to store an object (or keep track of an object) because it is long-lived but the current scope has to be short-lived.

If you’ve been programming for a while you are really good at solving both of these puzzles because you solve them all the time. Which is another reason for why it’s difficult to convince people that it’s worth looking into alternatives: If you are a programmer today, these don’t seem that complicated to you.

But I want to investigate how much can be gained by looking at different approaches to call stacks. I think the potential gains are huge, because this is such a core piece of programming.

Read the rest of this entry »

Ideas for a Programming Language Part 1: Source Code in Database

My main motivation for wanting to write a programming language is that I believe I can make programmers much more productive. Somewhere in the archives of unfinished blog posts for this website here I have a very long post about what language features and coding practices I think contribute to programmer productivity, (and what harms productivity) but I believe that in the long term the one most important contributor is the quality the tools that we use to program.

And “tools” is a very vague word. It includes everything from source control to text editors to test frameworks to debuggers to refactoring helpers to code completion to compiler warning messages to static analysis to profilers, diff, make and many more categories. All of this surrounding infrastructure that we use around coding actually has a much bigger impact on productivity than which language we pick. Which makes sense because those tools are usually written by someone not directly involved in the language. And if they took the time to write the tool, you bet it will have a big impact on their productivity. So I want to make a language that will have the best tools ever. I think that’s actually not too difficult. It seems that nobody has had that ambition before.

And for that my language will store its source code in a database instead of text files.

Read the rest of this entry »

plalloc: A simple stateful allocator for node based containers

Allocators in C++ are awkward classes. Allocators are usually zero size to make the containers small, and they have no state because that used to be difficult to do in C++. But nowadays we don’t really care about the size of our containers (we care about the size of the content of the containers) and since C++11 we have support for stateful allocators.

The problem I’m trying to solve is that node based containers have bad cache behavior because they allocate all over the place. So I wrote a small allocator which gives out memory from a contiguous block. It speeds up std::map and std::unordered_map. It’s called plalloc because I think this is a pool allocator.

Code is below:

Read the rest of this entry »

Ideas for a Programming Language

I’ve been simmering ideas for a programming language for a while. I’ll probably get around to actually writing one in a year or so. But Jonathan Blow is writing a new language right now and there is some overlap between his ideas and my ideas, so I kinda feel compelled to write about mine.

Since he just had a talk about compile time function evaluation, that will be my first post. But that’s not actually the order in which I want to write about things, so I’ll do a Star Wars move and post part 3 before posting part 1 and 2.

But still this post is a summary of what I will write:

Read the rest of this entry »


Get every new post delivered to your Inbox.