Our generous forever free tier includes the full platform, including the AI Assistant, for 3 users with 10k metrics, 50GB logs, and 50GB traces.
Built on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
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.
The C++-programs simulate : Nondeterministic/Deterministic Multitape Turing & Post Machines, Universal Turing Machine, Turing Machine with faults, failures and recovery.
An exploration utility to view, render and record TMC-patterns
This utility is designed for comfortable and rich control over Turing-McCabe-patterns. It offers realtime exploration using several input parameters, storing and restoring settings, recording videos and taking snapshots of steps as well as rendering patterns in HD.
The C++-programs simulate : Nondeterministic/Deterministic Multitape Turing & Post Machines, Universal Turing Machine, Turing Machine with faults, failures and recovery.
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.
This is my implementation of Langton's Ant (a popular turing machine, see http://en.wikipedia.org/wiki/Langton%27s_ant for more information) using C#. Supports multiple ants and threading. Video: http://www.youtube.com/watch?v=Vu9C_1DH31k
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.
Alan is a Java Implenmentation of a Turing Machine for educational purpose. Features include: - Easy to use GUI - Many example Programs - ReUsable Turing Machine Component
The ASP CAPTCHA Project (ASP Implementation of CAPTCHA)
CAPTCHA is an acronym for "Completely Automated Public Turing Test to Tell Computers & Humans Apart".
It can generate & grade tests that:
Most humans can pass
Current computer programs can't
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.