- 430

Turing machine simulator simulates the working of Turing machine. Turing machine is used to study model of computation.

http://tmsimulator.codeplex.com/Tags | simulator turing-machine |

Implementation | |

License | GPLv2 |

Platform | Windows |

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.

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

Turing Lego Machine it's the attempt to create the robotic model (based on the LEGO Mindstorms NXT 2.0) of the abstract mathematical theory "Turing Machine".

Tensorflow implementation of Neural Turing Machine. This implementation uses an LSTM controller. NTM models with multiple read/write heads are supported. The referenced torch code can be found here.

tensorflow neural-turing-machinesAlan is a Java Implenmentation of a Turing Machine for educational purpose. Features include: - Easy to use GUI - Many example Programs - ReUsable Turing Machine Component

A Torch implementation of the Neural Turing Machine model described in this paper by Alex Graves, Greg Wayne and Ivo Danihelka. This implementation uses an LSTM controller. NTM models with multiple read/write heads are supported.

News: Turing.jl is now Julia 1.0 compatible now! Be aware that some things still might fail. Turing was originally created and is now managed by Hong Ge. Current and past Turing team members include Hong Ge, Adam Scibior, Matej Balog, Zoubin Ghahramani, Kai Xu, Emma Smith, Emile Mathieu, Martin Trapp. You can see the full list of on Github: https://github.com/TuringLang/Turing.jl/graphs/contributors.

machine-learning probabilistic-programming mcmc-sampler julia-language artificial-intelligence bayesian-inferenceGeneric POSIX printf itself can be Turing complete as shown in Control-Flow Bending. Here we take printf-oriented programming one step further and preset a brainfuck interpreter inside a single printf statement. An attacker can control a printf statement through a format string vulnerability (where an attacker-controlled string is used as first parameter to a printf-like statement) or if the attacker can control the first argument to a printf statement through, e.g., a generic memory corruption. See the disclaimer below for practical in the wild considerations.

turing-machine brainfuck-interpreter printf exploitation-frameworkPackage ntm implements the Neural Turing Machine architecture as described in A.Graves, G. Wayne, and I. Danihelka. arXiv preprint arXiv:1410.5401, 2014. Using this package along its subpackages, the "copy", "repeatcopy" and "ngram" tasks mentioned in the paper were verified. For each of these tasks, the successfully trained models are saved under the filenames "seedA_B", where A is the number indicating the seed provided to rand.Seed in the training process, and B is the iteration number in which the trained weights converged.

Grid-Soccer Simulator is a multi-agent soccer simulator in a grid-world environment. The environment provides a test-bed for machine-learning, control algorithms, and multi-agent learning especially multi-agent reinforcement learning.

client-server distributed-ai grid-world gridsoccer machine-learning marlSki is an instruction simulator designed to execute and test ia64 code on non-ia64 machines. This is CPU simulator only; there is no machine simulator (for all the stuff beyond the CPU such as the PCI bus or random IO devices).

Fido is an lightweight, highly modular C++ machine learning library for embedded electronics and robotics. Fido is especially suited for robotic and embedded contexts, as it is written in C++ with minimal use of the standard library, comes packaged with a robotic simulator, and provides and easy interface in which to write robotic drivers. Check out the project site and documentation for more information.

robotics machine-learning neural-network embedded betaThe Binary Code Interpreter is a small and funny programming languaage. This interpreter works a bit like a Turing Machine.

binary fun interpreterTrinkets for hackers. Currently: Rubik cube move series inventor. Go solver for tiny boards. Jokes converted into lateral puzzles. Turing machine enumeration Things coming: sci-fi ideas/stories, chess (endgame), etc... License GPL+GFDL

This is a proof by construction that the Intel MMU's fault handling mechanism is Turing complete. We have constructed an assembler that translates 'Move, Branch if Zero, Decrement' instructions to C source that sets up various processor control tables. After this code has executed, the CPU computes by attempting to fault without ever executing a single instruction. Optionally, the assembler can also generate X86 instructions that will display variables in the VGA frame buffer and will cause control to be transferred between the native (display) instructions and 'weird machine' trap instructions. To read up on the awesome idea of weird machines and their uses, see @sergeybratus's and @halvarflake's work. In short, we are trying to find hidden state and derive computation of it in unexpected places. One practical use of this technique is for code obfuscation - many (kernel) debuggers will break due to the frequent context switches (esp. cooperative debuggers like KGDB) and analyzing the binary is going to be extraordinaly confusing, especially if normal X86 instructions and trap instructions are interleaved to do weird control transfer. Furthermore, out of the many virtual machines only Bochs runs such trap based programs correctly (and there are other tricks to distinguish bochs from a real box).

Jx9 is an embeddable scripting engine that implements a Turing complete programming language based on JSON. Jx9 is the ideal library to use in applications that require modern and efficient scripting support such as games, database systems, text editors, network applications and so forth. Jx9 also natively supports multi-threading and the concept of separate engine handles and virtual machines.

scripting-engine scripting programming-language turing-complete turingAttempt at implementing system described in "Neural Turing Machines." by Alex Graves, Greg Wayne, and Ivo Danihelka. I've documented some of my adventures on my blog, you can check out the articles on this particular project here.

Randomly generated Turing machines draw images and animations on a 2D canvas. A simple JavaScript+HTML5 demo. This project is distributed under a modified BSD license. I've also written a blog post briefly describing this project.

We have large collection of open source products. Follow the tags from
Tag Cloud >>

Open source products are scattered around the web. Please provide information
about the open source projects you own / you use.
**Add Projects.**