Randomly Typed

JS and special guest Max discuss the slow web phenomenon and discuss what makes some technological experiences more meaningful than others.

We discover why the unsolved P == NP millennium problem is so difficult, and how the ramifications affect our every-day programming.

We talk about Bloom filters, a probabilistic data structure for set membership queries, how they work, and what all the fuss is about.

We explore Facebook's new cryptocurrency and discuss it's potential ramifications on our society and global economy.

We look at the prefix scan algorithm for the sum operation, and discover how it can be parallelized in a relatively simple but unintuitive way.

We discuss the origins of accessibility and how things changed as society moved into the digital age.

We go over the fundamentals of distributed systems and get to the bottom of buzzwords like scalability, availability and transparency.

We explore the topic of software quality and discover what technical debt actually means.

We discuss the projects we have been working on in our spare time and what we've learned in the process.

In this episode, we discuss the different kinds of database transactions, how they are implemented, and what guarantees they provide.

Can I take your code and sell it? We discuss the variety of available licenses and whether they make sense in our current technological landscape.

In this episode, we discuss divide and conquer algorithms like merge sort, and see why it's more challenging to analyze their complexity.

Are cryptocurrencies just hype? Probably, but let's still talk about how they were created, their merits and their problems.

An overview of computational complexity theory.