Find link

language:

Find link is a tool written by Edward Betts.

searching for Turing completeness 10 found (50 total)

Queue automaton (785 words) [view diff] no match in snippet view article find links to article

A queue machine, queue automaton, or pullup automaton (PUA)[citation needed] is a finite-state machine with the ability to store and retrieve data from

Befunge (1,245 words) [view diff] exact match in snippet view article find links to article

subsequent extensions like Funge-98 expanded the concept to achieve Turing completeness. The name "Befunge" originated from a typing error in an online discussion

SunVox (1,088 words) [view diff] no match in snippet view article find links to article

SunVox, also known as SunVox Modular Music Creation Studio, is a 2008 music creation tool built around the SunVox Engine, a software-based modular synthesizer

Sigreturn-oriented programming (1,410 words) [view diff] no match in snippet view article find links to article

Sigreturn-oriented programming (SROP) is a computer security exploit technique that allows an attacker to execute code in presence of security measures

Π-calculus (4,864 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, the π-calculus (or pi-calculus) is a process calculus. The π-calculus allows channel names to be communicated along the

Abelian sandpile model (5,039 words) [view diff] no match in snippet view article find links to article

The Abelian sandpile model (ASM) is the more popular name of the original Bak–Tang–Wiesenfeld model (BTW). The BTW model was the first discovered example

Turing Tumble (799 words) [view diff] case mismatch in snippet view article find links to article

09343. doi:10.1016/j.tcs.2023.113734. S2CID 239016461. "Proof of Turing Completeness?". Turing Tumble Community Bboard. 2018-07-17. Frauenfelder, Mark

Template (C++) (2,476 words) [view diff] no match in snippet view article

Templates and C# Generics (C# Programming Guide)". 12 March 2024. Demonstration of the Turing-completeness of C++ templates (Lambda calculus implementation)

Program synthesis (2,875 words) [view diff] case mismatch in snippet view article find links to article

Robert S.; Moore, J. Strother (May 1983). A Mechanical Proof of the Turing Completeness of Pure Lisp (PDF) (Technical report). Institute for Computing Science

Algorithm (7,123 words) [view diff] exact match in snippet view article find links to article

thesis, any algorithm can be computed by any Turing complete model. Turing completeness only requires four instruction types—conditional GOTO, unconditional