Showing 11 open source projects for "turing machine"

View related business solutions
  • Our Free Plans just got better! | Auth0 Icon
    Our Free Plans just got better! | Auth0

    With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.

    You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
    Try free now
  • Build Agents and Models on One Platform Icon
    Build Agents and Models on One Platform

    Everything you need to build production-ready agents and models. Access 200+ Google and third-party AI models and tools.

    Gemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
    Try It Free
  • 1
    Autograd

    Autograd

    Efficiently computes derivatives of numpy code

    Autograd can automatically differentiate native Python and Numpy code. It can handle a large subset of Python's features, including loops, ifs, recursion and closures, and it can even take derivatives of derivatives of derivatives. It supports reverse-mode differentiation (a.k.a. backpropagation), which means it can efficiently take gradients of scalar-valued functions with respect to array-valued arguments, as well as forward-mode differentiation, and the two can be composed arbitrarily....
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2

    baffle

    Baffle Is an extension to Brainfuck language, it adds a stack, more

    baffle Is an extension to BF language (https://esolangs.org/wiki/brainfuck), which itself in turn is a extension of Turing machine. baffle extends BF by adding a stack, support for procedures, adding more arithmetic instructions, and a register. baffle can run original BF programs, and while it's not the fastest implementation of BF, but it's written in such a way that makes it easier to replace the instruction set, and to write similar languages.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    Speakable Programming for Every Language

    Speakable Programming for Every Language

    Your language to speak with all.

    This project has the language data for spel, the main new codebase is at: https://gitlab.com/liberit/pyac A computer programming language using human language syntax for human-to-human and human-to-computer communication with high precision, supporting many languages. Currently has alpha prototype support for analytic versions of the UN languages English, Mandarin Chinese, Spanish, Arabic, Russian...
    Downloads: 1 This Week
    Last Update:
    See Project
  • 4
    binary Turing Machine

    binary Turing Machine

    A Turing Machine Simulator

    Free binary Turing Machine simulator with a graphical user interface and possibility to save your files. Language : French (no translation available)
    Downloads: 0 This Week
    Last Update:
    See Project
  • Build Securely on AWS with Proven Frameworks Icon
    Build Securely on AWS with Proven Frameworks

    Lay a foundation for success with Tested Reference Architectures developed by Fortinet’s experts. Learn more in this white paper.

    Moving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
    Download Now
  • 5
    The C++-programs simulate : Nondeterministic/Deterministic Multitape Turing & Post Machines, Universal Turing Machine, Turing Machine with faults, failures and recovery.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 6

    fiftyfifty

    fiftyfifty is a programming language and game

    As you may recall, a Turing-machine is an all-purpose computer. A Turing-machine has a memory that consists of a track or line of data. On the track, a read-/write-head is moving. The read-write head itself is a state engine, which is affected by the input from the track, and which decides what to write on the track, and where to read the next input, by "moving" the head back or forth.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 7
    The `Turing Machine Compiler Collection' (tmcc) contains a virtual machine which emulates a Turing Machine such as an assembler and a C-like compiler which assemble/compile the written code into the delta-notation.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 8
    PHPTuring is a Turing Machine simulator built in Object-Oriented PHP5, using the Test-Driven (TDD) approach.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 9
    turt. A language package for creating Turing machines and passing input for processing by the machine described by the language tt.
    Downloads: 0 This Week
    Last Update:
    See Project
  • $300 Free Credits to Build on Google Cloud Icon
    $300 Free Credits to Build on Google Cloud

    New to Google Cloud? Get $300 in credits to explore Compute Engine, BigQuery, Cloud Run, Gemini Enterprise Agent Platform, and more.

    Start your next project with $300 in free Google Cloud credit. Spin up VMs, run containers, query petabytes in BigQuery, or build agents with Gemini Enterprise Agent Platform. Once your credits are used, keep building with 20+ always-free tier products including Compute Engine, Cloud Storage, GKE, and Cloud Run functions. No commitment required—just sign up and start building.
    Claim $300 Free
  • 10
    Model implementation for the BaSa language, a Turing-like language. This simple language is to be run in a virtual machine. The proposed language specification is defined in http://www.cs.ui.ac.id/kuliah/IKI40800/model.html
    Downloads: 0 This Week
    Last Update:
    See Project
  • 11
    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next
Auth0 Logo