Topics /

Math & Algorithms

The most popular blog posts about math & algorithms on Hacker News. 106 posts.

2015
62

Wolfram Language

Transcript of Stephen Wolfram's talk at SXSW 2015 on the present and future of computing: Wolfram Language, image recognition, language-design philosophy, tweetable programs, computational thinking for kids, natural language as input, symbolic programming, deployment, automation of programming, Internet of Things…

64

Indices Point Between Elements

If you’re familiar with nearly any mainstream programming language, and I asked you to draw a diagram of an array, the array indices, and the array elements, odds are good you’d produce a diagram something like this: In this post, I want to persuade you to replace that image, or, at least, to augment it with an…

71

Magic: The Gathering Is Turing Complete (v5)

I'm assuming you're familiar with the basic idea of what a Turing machine is . There are a few parts to building one in Magic: a tape extending in two directions storing cells of a few different "colours"; a processing head that can read the current cell's colour, write a new colour and change its state if necessary…

74

Nibble Sort

A while back, John Regehr posted the Nibble Sort Programming Contest on his blog. The objective was to write a program that sorts the 4-bit components (nibbles) of 64-bit words as fast as possible. For example, 0x42badc0ffeed00d5 should result in 0xffeedddcba542000 after sorting.

76

Introduction to Category Theory

The aim of this course is to teach the basics of category theory, in a way that is accessible and relevant to computer scientists. The emphasis is on gaining a good understanding the basic definitions, examples, and techniques, so that students are equipped for further study on their own of more advanced topics if…

89

Small Introduction to Markov Chains

Introduction A Markov Chain is a set of transitions from one state to the next; Such that the transition from the current state to the next depends only on the current state, the previous and future states do not effect the probability of the transition. A transitions independence from future and past sates is called…

90

When Greedy Algorithms Are Good Enough (2014)

Greedy algorithms are among the simplest and most intuitive algorithms known to humans. Their name essentially gives their description: do the thing that looks best right now, and repeat until nothing looks good anymore or you’re forced to stop. Some of the best situations in computer science are also when greedy…