Search Results for "turing"
Sort By:
Showing 63 open source projects for "turing"
View related business solutions-
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
1
the-turing-way
Book repository for The Turing Way
A community‑led open handbook and living documentation project from the Alan Turing Institute, providing best practices and open guidance for reproducible, ethical, collaborative data science and research. -
2
Turing.jl
Bayesian inference with probabilistic programming
Bayesian inference with probabilistic programming. -
3
Common Expression Language
Fast, portable, non-Turing complete expression evaluation
The Common Expression Language (CEL) is a non-Turing complete language designed for simplicity, speed, safety, and portability. CEL's C-like syntax looks nearly identical to equivalent expressions in C++, Go, Java, and TypeScript. A CEL "program" is a single expression. The examples have been tagged as java, go, and typescript within the markdown to showcase the commonality of the syntax. -
4
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.... -
One Monitoring Tool for IT, OT and Cloud | Free TrialModern infrastructure spans data centers, cloud platforms and factory floors, and every blind spot between them is a risk. PRTG supports SNMP, WMI, SSH and other standard protocols to monitor IT, OT and hybrid environments through one customizable dashboard. Build the views your team needs, from network health to application performance, without switching tools. Try PRTG free for 30 days now.
-
5
XWizard
XWizard Online Informatics Toolbox
XWizard is a free (web) tool for the automatic visualization, manipulation and PDF generation of many types of objects from theoretical computer science (such as Turing machines, push-down and finite automata, Chomsky grammars etc.). A broad range of algorithms can be applied to the objects, producing intuitive and customizable views. XWizard is well-suited for students’ self-studies, and it is powerfull in aiding teachers at the creation of course material such as exercises (the X in XWizard stands for “eXercise” – and also for “anything”). -
6
pyexpander
A powerful macro processor based on python
Pyexpander is a powerful macro processor based on python. Instead of simple macro replacement it offers evaluation of arbitrary python expressions and execution of python code. Pyexpander is Turing Complete. -
7
nars2000
NARS2000: An Experimental APL Interpreter
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. -
8
Bayesian Julia
Bayesian Statistics using Julia and Turing
Bayesian statistics is an approach to inferential statistics based on Bayes' theorem, where available knowledge about parameters in a statistical model is updated with the information in observed data. The background knowledge is expressed as a prior distribution and combined with observational data in the form of a likelihood function to determine the posterior distribution. The posterior can also be used for making predictions about future events. Bayesian statistics is a departure from... -
9
Aurae
Distributed systems runtime daemon written in Rust
Aurae is on a mission to be the most loved and effective way of managing workloads on a node. Our hope is that by bringing a better set of controls to a node, we can unlock brilliant higher-order distributed systems in the future. Aurae deploys a memory-safe 1 runtime daemon, process manager, and PID-1 initialization system to remotely schedule processes, containers, and virtual machines as well as set node configurations (e.g., networking storage). Through system proportioning and... -
Demo Series - Small Business Backup By VeeamWatch this on-demand demo series and learn how to protect your Microsoft 365 data with clear, simple, actionable steps that are easy to implement for businesses of all sizes.
-
10
Soss
Probabilistic programming via source rewriting
Soss is a library for probabilistic programming. Soss and DynamicPPL are both maturing and becoming more complete, so the above will change over time. It's also worth noting that we (the Turing team and I) hope to move toward a natural way of using these systems together to arrive at the best of both. -
11
Not Another Markup Language
Convert Kubernetes YAML to Golang
NAML is a Go library and command line tool that can be used as a framework to develop and deploy Kubernetes applications. Kubernetes applications are complicated, so let's use a proper Turing complete language to reason about them. -
12
WaykiChain
Public Blockchain as a Decentralized Finance Infrastructure Service
WaykiChain is a high-performance, Turing-complete blockchain platform optimized for decentralized applications and smart contracts. It offers a delegated proof-of-stake (DPoS) consensus mechanism for faster transactions and energy efficiency, and it includes support for DeFi, stablecoins, and governance tools. Designed for commercial-grade use, WaykiChain enables developers to build scalable dApps while offering low-latency transaction processing and customizable consensus rules. ... -
13
HMMBase.jl
Hidden Markov Models for Julia
HMMBase is not maintained anymore. It will keep being available as a Julia package but we encourage existing and new users to migrate to HiddenMarkovModels.jl which offers a similar interface. For more information see HiddenMarkovModels.jl: when did HMMs get so fast?. HMMBase provides a lightweight and efficient abstraction for hidden Markov models in Julia. Most HMMs libraries only support discrete (e.g. categorical) or Normal distributions. In contrast HMMBase builds upon Distributions.jl... -
14
OpenSeq2Seq
Toolkit for efficient experimentation with Speech Recognition
...It supports multi-GPU and multi-node data-parallel training, and integrates with Horovod to scale out across large GPU clusters. Mixed-precision support (float16) is optimized for NVIDIA Volta and Turing GPUs, allowing significant speedups and memory savings without sacrificing model quality. The project comes with configuration-driven training scripts, documentation, and examples that demonstrate how to set up pipelines for tasks. -
15
Xidel
Command line tool to download and extract data from HTML/XML pages
Xidel is a command line tool to download and extract data from HTML/XML pages as well as JSON APIs. -
16
turing-s-machine
Attempt to make a Turing's machine emulator
-
17
AutoSim
A free automata simulator that simulates DFA/NFA/DPDA/NPDA/STM
...With AutoSim, you can not only determine the final state or stack/tape contents, you can also trace through the execution states as well, from the initial to the final states. The latest version of AutoSim is 1.0, and it currently supports DFAs, NFAs, DPDAs, NPDAs, as well as Standard Turing Machines. -
18
-
19
Huffman codes on a Turing Machine
Computing Huffman codes on a Turing Machine
Computing Huffman codes on a Turing Machine -
20
Fibonacci numbers on a Turing Machine
Computing Fibonacci numbers on a Turing Machine
Computing Fibonacci numbers on a Turing Machine https://arxiv.org/abs/cs/0601050 -
21
CQU
Decision solver for Counting Quantifiers over Unary Predicates
...The implemented method employs dual Simplex Algorithm with Column Generation. At each iteration, a SAT instance is generated and a SAT Solver (minisat) decides its satisfiability. Details about CQUSAT, its normal form and this turing reduction can be found in the paper "CQUSAT.pdf" that comes with this package. For more information, see the README file. -
22
TISP
A simple, LISP-like programming language.
ThyLordRoot's Interpreted S-expression Parser (TISP) is a LISP-like programming language developed for the benefit of ThyLordRoot's viewers on Twitch.tv. This heritage was chosen for its simplicity and affordance of rapid prototyping. Although it is a toy language, it is intended to be Turing complete, and bootstrapping TISP is a major goal. -
23
turing machine simulation
turing machine simulation with gui
A turing machine simulation. With infinite tape, and finite states of instructions, finite symbols language. Full operational, complete. Coded with reference to http://en.wikipedia.org/wiki/Turing_machine. Have fun! -
24
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) -
25
fvm2
FVM2 - F Virtual Machine v2
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.
