nowfound

Life & fun · January 18, 2019

A Golang library to build Turing machine

A Golang library to build Turing machine launched on January 18, 2019 with 6 votes, #1,243 of 2,587 launches that month and more than 50% of that year's launches. The site was still online in September 2026, 7 years on.

What it does

In 1962, Hungarian mathematician Tibor Radó introduced the Busy Beaver competition for Turing machines: in a class of machines, find one which halts after the greatest number of steps when started on the empty input. Even if it could seem trivial, the Busy Beaver competition has implications in computability theory, the halting problem, and complexity theory. I decided to use GoLang to implement a Turing machine library and accomplish three goals: first, having a Turing Machine model to play with for learning purpose; second, learning how to use interfaces and the factory pattern, other then testing package to test my code and let it be more flexible for future enhancement (at least I…from made2591.github.io

Does a similar job

all alternatives →

More life & fun this month

the category →

Source: Show HN post ↗

Launched alongside, January 2019

the whole month →