Acme::Turing - Turing machine emulation

This module gives you the methods needed to emulate a Turing machine in Perl. Why? Because we can. This module is based on Turing's original paper (see REFERENCES), which allows complete freedom in the actions to be taken before the machine enters a ...

GROMMEL/Acme-Turing-0.02 - 28 Jul 2008 16:45:24 GMT - Search in distribution

Acme::Brainfuck - Embed Brainfuck in your perl code

Brainfuck is about the tiniest Turing-complete programming language you can get. A language is Turing-complete if it can model the operations of a Turing machine--an abstract model of a computer defined by the British mathematician Alan Turing in 193...

JALDHAR/Acme-Brainfuck-1.1.1 - 06 Apr 2004 16:25:35 GMT - Search in distribution

Acme::HaltingProblem - A program to decide whether a given program halts

The Halting Problem is one of the hardest problems in computing. The problem, approximately stated, is thus: Given an arbitrary Turing Machine T and input for that turing machine D, decide whether the computation T(D) will terminate. new Acme::Haltin...

SHEVEK/Acme-HaltingProblem-1.00 - 12 Jan 2004 18:05:30 GMT - Search in distribution

3 results (0.173 seconds)