The London Perl and Raku Workshop takes place on 26th Oct 2024. If your company depends on Perl, please consider sponsoring and/or attending.

Search results for "dist:Acme-HaltingProblem SHEVEK"

Acme::HaltingProblem - A program to decide whether a given program halts River stage zero No dependents

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 UTC
1 result (0.024 seconds)