Showing 3 open source projects for "turing machine"

View related business solutions
  • 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
  • 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
  • 1

    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
  • 2
    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
  • 3
    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