Search Results for "turing"

APL is an arrary-oriented language initially conceived in the 1960s by Kenneth E. Iverson, IBM Fellow and 1979 ACM Turing Award recipient. It is ideally suited to computer programming because it subsumes the tedious aspects of the job allowing the programmer to concentrate on the heart of the project. NARS2000 is a Free Open Source implementation of APL. For more details on this project, visit the NARS2000.org website.

Free binary Turing Machine simulator with a graphical user interface and possibility to save your files. Language : French (no translation available)

FVM2 is VM for running machines like Markov algorithms, Turing machine and so on. FVM2 has debugger with step mode and breakpoints. Goal of this project is to help students with studying Theory of computation. FVM2 shows how complex code works within a real machine. Currently the only implemented machine is Markov algorithms.

The C++-programs simulate : Nondeterministic/Deterministic Multitape Turing & Post Machines, Universal Turing Machine, Turing Machine with faults, failures and recovery.

https://github.com/thibaultduponchelle/nanoturing

TuringIDE is an integrated development environment (IDE) for simulating Turing Machines with multiple tapes and states. It offers debugging tools, XML import/export, and other advanced features for scientific experiments on formal symbol allocations.

Rmutt is a Turing-complete interpreted language for generating random strings from context-sensitive grammars.

Sample turing machine for educational purposes.

Turing Machine Simulator. Released for testing purpose.

Tuatara Turing Machine Simulator is a graphical tool for designing and executing Turing Machines. Designed primarily for teaching purposes, it features a simple point-and-click interface.

This program emulates Turing Machines. They can be deterministic or non-deterministic and must have a single tape. You must enter transitions, an initial status, and characters to the tape.

Visual Turing Machine is a tool for visually designing Turing machines. This means no coding in abstract scripting languages, but simple point&click design. It uses the a..z symbol set, plus the "empty" # symbol, and also simulates an infinite tape.

TURing human IDentification, a textual highly accessible alternative to image CAPTCHAs involving the usage of simple phrases and based on the language recognition features of the user, supposedly human.

EMT is an application to draw and test turing machines intended to help Formal Languages and Automata students to understand how turing machines work and test their own turing machines.

PHPTuring is a Turing Machine simulator built in Object-Oriented PHP5, using the Test-Driven (TDD) approach.

Monod is a computational model inspired by the biology of cells and the implementation of a simulation of this model.  Thinking of proteins as abstract processing units with a rich context leads to an alternative to the Turing / von Neumann architecture.

A function is computable if it can be computed by a Turing machine. A Turing machine is a very simple machine, but, logically speaking, has all the power of any digital computer. The Turing Optimizer utilizes this to superoptimize code.

java-turing-emulator aims to provide a GUI for creating, editing and simulating Turing machines and deterministic machines. its build in java and uses the swt-framework.

MultiTM is a n-Tape Turing-Machine simulator. It executes self-written Turing machines with up to 100 tapes as well as preconfigured TMs.