Search Results for "turing"
Sort By:
Showing 98 open source projects for "turing"
View related business solutions-
Our Free Plans just got better! | Auth0 by OktaYou 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 secuirty. Auth0 now, thank yourself later.
-
Bright Data - All in One Platform for Proxies and Web ScrapingBright Data offers the highest quality proxies with automated session management, IP rotation, and advanced web unlocking technology. Enjoy reliable, fast performance with easy integration, a user-friendly dashboard, and enterprise-grade scaling. Powered by ethically-sourced residential IPs for seamless web scraping.
-
1
Turing.jl
Bayesian inference with probabilistic programming
Bayesian inference with probabilistic programming. -
2
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.... -
3
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... -
4
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. CEL is ideal for lightweight expression evaluation when a fully sandboxed scripting language is too... -
Build Securely on Azure with Proven FrameworksMoving 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.
-
5
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... -
6
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. -
7
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. -
8
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. -
9
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. -
Claims Processing solution for healthcare practitioners.Speedy Claims became the top CMS-1500 Software by providing the best customer service imaginable to our thousands of clients all over America. Medical billing isn't the kind of thing most people get excited about - it is just a tedious task you have to do. But while it will never be a fun task, it doesn't have to be as difficult or time consumimg as it is now. With Speedy Claims CMS-1500 software you can get the job done quickly and easily, allowing you to focus on the things you love about your job, like helping patients. With a simple interface, powerful features to eliminate repetitive work, and unrivaled customer support, it's simply the best HCFA 1500 software available on the market. A powerful built-in error checking helps ensure your HCFA 1500 form is complete and correctly filled out, preventing CMS-1500 claims from being denied.
-
10
Arduino IO Simulator Drag & Draw
Simulate your IO with the Arduino Simulator
You bought an Arduino, What now? This Arduino Simulator is different than all the other simulators. If you don’t have components like sensors, Leds..., then this program will simulate the components for you. You need a real Arduino board for testing your programs with your computer. You can drag and drop the components in a worksheet and you can draw everything you want around it. It is also possible to load a background into the worksheet. You can also combine simulated... -
11
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... -
12
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. Every cell is a single byte... -
13
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. -
14
turing-s-machine
Attempt to make a Turing's machine emulator
-
15
Turing and Post Machines: C++ Simulators
Turing and Post Machines' C++ Simulators
The C++-programs simulate : Nondeterministic/Deterministic Multitape Turing & Post Machines, Universal Turing Machine, Turing Machine with faults, failures and recovery. -
16
-
17
Huffman codes on a Turing Machine
Computing Huffman codes on a Turing Machine
Computing Huffman codes on a Turing Machine -
18
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 -
19
AutoSim
A free automata simulator that simulates DFA/NFA/DPDA/NPDA/STM
AutoSim is a free automata simulator for students and educators. Written in Java, it is a command-line based utility that runs on any OS that supports Java. 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. -
20
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... -
21
-
22
CQU
Decision solver for Counting Quantifiers over Unary Predicates
..., and inherit from it. Given a CQUSAT instance in normal form as input, the program returns a solution, if there is one. 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. -
23
Turing machine in Python
A turing machine in Python
A turing machine in Python -
24
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. -
25
Turing McCabe-Explorer
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.