Find link

language:

jump to random article

Find link is a tool written by Edward Betts.

Longer titles found: MIX (abstract machine) (view), Warren Abstract Machine (view), Categorical abstract machine (view)

searching for Abstract machine 48 found (144 total)

alternate case: abstract machine

BEAM (Erlang virtual machine) (411 words) [view diff] case mismatch in snippet view article

beam file extension. Originally BEAM was short for Bogdan's Erlang Abstract Machine, named after Bogumil "Bogdan" Hausman, who wrote the original version
Quil (instruction set architecture) (903 words) [view diff] case mismatch in snippet view article
Curtis and Zeng, Quil specifies the instruction set for a Quantum Abstract Machine (QAM,) akin to a Turing machine, yet more practical for accomplishing
B-Method (1,623 words) [view diff] exact match in snippet view article find links to article
development based on B, a tool-supported formal method based on an abstract machine notation, used in the development of computer software. B was originally
Μ operator (3,211 words) [view diff] exact match in snippet view article find links to article
Boolos-Burgess-Jeffrey (2002) p. 60-61 provide definitions of the μ-operator as an abstract machine; see footnote Alternative definitions of μ. The following demonstration
Java processor (422 words) [view diff] exact match in snippet view article find links to article
words, the Java bytecode that makes up the instruction set of the abstract machine becomes the instruction set of a concrete machine. These were the most
Burak Arıkan (629 words) [view diff] exact match in snippet view article find links to article
complex networks and thereby generates data and inputs in the custom abstract machine. Arikan is the founder of Graph Commons, a platform for mapping, analyzing
Reversible computing (2,372 words) [view diff] exact match in snippet view article find links to article
computation that uses deterministic transitions from one state of the abstract machine to another, a necessary condition for reversibility is that the relation
Meta-circular evaluator (1,921 words) [view diff] no match in snippet view article find links to article
In computing, a meta-circular evaluator (MCE) or meta-circular interpreter (MCI) is an interpreter which defines each feature of the interpreted language
Mali (processor) (4,744 words) [view diff] case mismatch in snippet view article
"Mali GPU: An Abstract Machine - Frame Pipelining". community.arm.com. 2014-02-03. Retrieved 2023-09-16. "Mali GPU: An Abstract Machine: Tile-based Rendering"
Static program analysis (1,864 words) [view diff] exact match in snippet view article find links to article
an abstract machine (i.e., it 'executes' the software based on the mathematical properties of each statement and declaration). This abstract machine over-approximates
GNU Prolog (102 words) [view diff] exact match in snippet view article find links to article
the source code into byte code that can be interpreted by a Warren abstract machine (WAM) and converts that to standalone executables. Free and open-source
Schizoanalysis (3,556 words) [view diff] exact match in snippet view article find links to article
component. This is often referred to as the abstract machine[.] [...] Unlike semiotics and signs, the abstract machine does not function to represent, but rather
Oberon-2 (2,208 words) [view diff] exact match in snippet view article find links to article
The Keiko Abstract Machine". quote: "The Oxford Oberon--2 compiler translates source programs into code for a stack-based abstract machine... the Keiko
SPITBOL (430 words) [view diff] exact match in snippet view article find links to article
McCann. MACRO SPITBOL is coded in MINIMAL, an assembly language for an abstract machine. The instruction set is carefully defined to allow some latitude in
David Culler (319 words) [view diff] case mismatch in snippet view article find links to article
(NOW), Internet services, Active Message, Split-C, and the Threaded Abstract Machine (TAM). Culler earned his B.A. at UC Berkeley and his Ph.D. at MIT.
Tag system (2,127 words) [view diff] exact match in snippet view article find links to article
of a Post canonical system. A tag system may also be viewed as an abstract machine, called a Post tag machine (not to be confused with Post–Turing machines)—briefly
Mimsy Were the Borogoves (888 words) [view diff] exact match in snippet view article find links to article
parents' view, Scott begins collecting and creating small items for an abstract machine, largely at Emma's direction and guidance; she has more knowledge about
Von Neumann universal constructor (2,555 words) [view diff] exact match in snippet view article find links to article
crossed for machines to be able to evolve. His answer was to specify an abstract machine which, when run, would replicate itself. In his design, the self-replicating
Formal specification (1,261 words) [view diff] case mismatch in snippet view article find links to article
Specification Language (VDM-SL) of the Vienna Development Method and the Abstract Machine Notation (AMN) of the B-Method. In the Web services area, formal specification
Hardware abstraction (1,506 words) [view diff] exact match in snippet view article find links to article
IBM i operating system. Most compilers for those systems generate an abstract machine code; the Licensed Internal Code, or LIC, translates this virtual machine
Elaine Kraf (662 words) [view diff] exact match in snippet view article find links to article
experimental novel, Find Him!, a "brilliant spatial meditation of the abstract machine of femininity." She was the recipient of two National Endowment for
Alice (programming language) (445 words) [view diff] case mismatch in snippet view article
implementation from Saarland University uses the Simple Extensible Abstract Machine (SEAM) virtual machine. It is free software, and features just-in-time
List of Java bytecode instructions (166 words) [view diff] exact match in snippet view article find links to article
This is a list of the instructions that make up the Java bytecode, an abstract machine language that is ultimately executed by the Java virtual machine. The
S-algol (3,053 words) [view diff] exact match in snippet view article find links to article
translated S-algol source into S-code, a bytecode for a stack-based abstract machine tailored for S-algol. The S-code was then executed by an interpreter
Universal Turing machine (2,946 words) [view diff] exact match in snippet view article find links to article
Alternating Turing machine – Abstract computation model Counter machine – Abstract machine used in a formal logic and theoretical computer science Kleene's T
NP (complexity) (2,771 words) [view diff] exact match in snippet view article
isomorphic to graph H. Turing machine – Computation model defining an abstract machine Polynomial time refers to how quickly the number of operations needed
The Information: A History, a Theory, a Flood (900 words) [view diff] exact match in snippet view article find links to article
in analogy to a gene Turing machine – Computation model defining an abstract machine "Best Sellers". The New York Times. 27 May 2011. Retrieved 7 July 2011
Robin Milner (915 words) [view diff] case mismatch in snippet view article find links to article
Retrieved 7 November 2009. Bigraphs [...] are proposed as a Ubiquitous Abstract Machine, playing the foundational role for ubiquitous computing that the von
Interpreter (computing) (4,547 words) [view diff] exact match in snippet view article
system. Defining a computer language is usually done in relation to an abstract machine (so-called operational semantics) or as a mathematical function (denotational
GigE Vision (407 words) [view diff] no match in snippet view article find links to article
2023. "GenICam Standard Homepage". Retrieved 26 April 2023. GigE Abstract: Machine vision's GigE Vision standard (2009) Blazing the GigE Vision Trail:
Computational complexity theory (6,302 words) [view diff] exact match in snippet view article find links to article
physically realizable model, it is just a theoretically interesting abstract machine that gives rise to particularly interesting complexity classes. For
Outline of C++ (1,646 words) [view diff] exact match in snippet view article find links to article
variety of application domains. Intermediate language — language of an abstract machine designed to aid in the analysis of computer programs. The term comes
ΛProlog (411 words) [view diff] case mismatch in snippet view article find links to article
Dustin Mitchell (1999). System Description: Teyjus - A Compiler and Abstract Machine Based Implementation of lambda Prolog. LNAI. Vol. 1632. pp. 287–291
Body without organs (1,943 words) [view diff] exact match in snippet view article find links to article
defined as a self-regulating process—created by the relation between an abstract machine and a machinic assemblage—that maintains itself through processes of
Functional completeness (1,874 words) [view diff] exact match in snippet view article find links to article
Making other gates using just NOR gates One-instruction set computer – Abstract machine that uses only one instruction Enderton, Herbert (2001), A mathematical
Pascal (programming language) (8,097 words) [view diff] exact match in snippet view article
the BSI 6192/ISO 7185 Standard and to generate code for a portable abstract machine. The first Pascal compiler written in North America was constructed
Functionalism (philosophy of mind) (6,403 words) [view diff] exact match in snippet view article
non-technical terms, a Turing machine is not a physical object, but rather an abstract machine built upon a mathematical model. Typically, a Turing Machine has a
Program optimization (4,487 words) [view diff] exact match in snippet view article find links to article
stale caches. Beyond general algorithms and their implementation on an abstract machine, concrete source code level choices can make a significant difference
Gustavo Romano (677 words) [view diff] case mismatch in snippet view article find links to article
2008, he presented “Sabotaje en la Máquina Abstracta”(Sabotage in the Abstract Machine), a ten years’ anthological solo show at the MEIAC of Badajoz, Spain
Paterson's worms (1,464 words) [view diff] exact match in snippet view article find links to article
with emergent behavior Turing machine – Computation model defining an abstract machine Turmite – Turing machine on a two-dimensional grid Beeler, Michael
Self-replicating machine (5,205 words) [view diff] exact match in snippet view article find links to article
crossed for machines to be able to evolve. His answer was to design an abstract machine which, when run, would replicate itself. Notably, his design implies
François Fages (683 words) [view diff] case mismatch in snippet view article find links to article
computational systems biology, coordinates the development of the Biochemical Abstract Machine (BIOCHAM) rule-based modeling and logical analysis software and studies
Laura P. Spinadel (1,372 words) [view diff] exact match in snippet view article find links to article
this sense, the Master Plan operates as an interactive device and abstract machine, a living body that is, in the end, a subject of its own material evolution
Actor model and process calculi history (2,420 words) [view diff] exact match in snippet view article find links to article
1993. Cédric Fournet and Georges Gonthier. The reflexive chemical abstract machine and the join-calculus POPL 1996. Cédric Fournet, Georges Gonthier,
Actor model and process calculi (3,220 words) [view diff] exact match in snippet view article find links to article
1994. Cédric Fournet and Georges Gonthier. The reflexive chemical abstract machine and the join-calculus POPL 1996. Cédric Fournet, Georges Gonthier,
The Real (22,040 words) [view diff] exact match in snippet view article find links to article
] An abstract machine [...] is diagrammatic [...] It operates by matter, not by substance.; by function, not by form. [...] The abstract machine is pure
Counter-machine model (3,298 words) [view diff] exact match in snippet view article find links to article
Reading, Massachusetts. Cf pages 462-463 where he defines "a new kind of abstract machine or 'automaton' which deals with linked structures." Joachim Lambek
PeSIT (2,393 words) [view diff] exact match in snippet view article find links to article
meant it haven't gained popularity. The PeSIT protocol functions as an abstract machine where FPDU (File Transfer Protocol Data Unit) messages are exchanged