Find link

language:

Find link is a tool written by Edward Betts.

searching for Model of computation 101 found (195 total)

Nondeterministic Turing machine (1,626 words) [view diff] exact match in snippet view article find links to article

science, a nondeterministic Turing machine (NTM) is a theoretical model of computation whose governing rules specify more than one possible action when

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

differs by replacing the stack with this queue. A queue machine is a model of computation equivalent to a Turing machine, and therefore it can process the

Unified Parallel C (267 words) [view diff] exact match in snippet view article find links to article

single processor. UPC uses a single program, multiple data (SPMD) model of computation in which the amount of parallelism is fixed at program startup time

Rosetta-lang (991 words) [view diff] no match in snippet view article find links to article

Rosetta semantics denotes each facet to a coalgebra that defines its model-of-computation. Because Rosetta is reflective, facets can be composed and transformed

Computer security model (184 words) [view diff] exact match in snippet view article find links to article

security model may be founded upon a formal model of access rights, a model of computation, a model of distributed computing, or no particular theoretical grounding

Certificate (complexity) (671 words) [view diff] exact match in snippet view article

whether a problem gives the answer "Yes" or "No". In the decision tree model of computation, certificate complexity is the minimum number of the n {\displaystyle

Markov algorithm (1,105 words) [view diff] exact match in snippet view article find links to article

Turing-complete, which means that they are suitable as a general model of computation and can represent any mathematical expression from its simple notation

Synchronous programming language (658 words) [view diff] exact match in snippet view article find links to article

formal specification formalisms. In contrast, in the asynchronous model of computation, on a sequential processor, the statement "a||b" can be either implemented

Peptide computing (262 words) [view diff] exact match in snippet view article find links to article

model so far. This model of computation has also been shown to be computationally universal (or Turing complete). This model of computation has some critical

Real computation (488 words) [view diff] exact match in snippet view article find links to article

Shannon's model can be adapted to cope with this problem.) A canonical model of computation over the reals is Blum–Shub–Smale machine (BSS). If real computation

High Performance Fortran (348 words) [view diff] exact match in snippet view article find links to article

array syntax introduced in Fortran 90, HPF uses a data parallel model of computation to support spreading the work of a single array computation over

Turing Machine (band) (267 words) [view diff] exact match in snippet view article

Chearno died in August 2024. The name comes from the mathematical model of computation defined by Alan Turing with the same name (Turing machine). A New

Post–Turing machine (2,767 words) [view diff] exact match in snippet view article find links to article

Turing machine, comprising a variant of Emil Post's Turing-equivalent model of computation. Post's model and Turing's model, though very similar to one another

Standard model (cryptography) (506 words) [view diff] exact match in snippet view article

In cryptography the standard model is the model of computation in which the adversary is only limited by the amount of time and computational power available

Fusion tree (2,434 words) [view diff] exact match in snippet view article find links to article

paper. In 1999 it was shown how to implement fusion trees under a model of computation in which all of the underlying operations of the algorithm belong

Continuous spatial automaton (360 words) [view diff] exact match in snippet view article find links to article

hallucinations. Bruce MacLennan considers continuous spatial automata as a model of computation, and demonstrated that they can implement Turing-universality. Analog

Vector Pascal (170 words) [view diff] exact match in snippet view article find links to article

designed to support efficient expression of algorithms using the SIMD model of computation. It imports into Pascal abstraction mechanisms derived from Iverson's

X-machine (2,547 words) [view diff] exact match in snippet view article find links to article

The X-machine (XM) is a theoretical model of computation introduced by Samuel Eilenberg in 1974. The X in "X-machine" represents the fundamental data type

Turing machine equivalents (2,667 words) [view diff] no match in snippet view article find links to article

A Turing machine is a hypothetical computing device, first conceived by Alan Turing in 1936. Turing machines manipulate symbols on a potentially infinite

Decider (Turing machine) (1,302 words) [view diff] exact match in snippet view article

second question asks, in essence, whether there is another reasonable model of computation which computes only total functions and computes all the total computable

SystemC AMS (1,515 words) [view diff] exact match in snippet view article find links to article

2016 as IEEE Std 1666.1-2016. ToDo: description ToDo: description A model of computation (MoC) is a set of rules defining the behavior and interaction between

Cell-probe model (1,404 words) [view diff] exact match in snippet view article find links to article

In computer science, the cell-probe model is a model of computation similar to the random-access machine, except that all operations are free except memory

Convex volume approximation (830 words) [view diff] exact match in snippet view article find links to article

in combinatorial enumeration. Often these works use a black box model of computation in which the input is given by a subroutine for testing whether a

Stream X-Machine (1,309 words) [view diff] exact match in snippet view article find links to article

The Stream X-machine (SXM) is a model of computation introduced by Gilbert Laycock in his 1993 PhD thesis, The Theory and Practice of Specification Based

Longest palindromic substring (2,189 words) [view diff] exact match in snippet view article find links to article

suffix trees. A faster algorithm can be achieved in the word RAM model of computation if the size σ {\displaystyle \sigma } of the input alphabet is in

Pseudorandomness (858 words) [view diff] exact match in snippet view article find links to article

is at most ε. In typical applications, the class F describes a model of computation with bounded resources and one is interested in designing distributions

Element distinctness problem (893 words) [view diff] exact match in snippet view article find links to article

the problem of size n {\displaystyle n} , in a comparison-based model of computation such as a decision tree or algebraic decision tree, is Θ ( n log

Quantum cellular automaton (1,334 words) [view diff] exact match in snippet view article find links to article

developed by Deutsch and so has not been developed significantly as a model of computation. The first formal model of quantum cellular automata to be researched

Zeno machine (877 words) [view diff] exact match in snippet view article find links to article

{\displaystyle 1} otherwise. Zeno machines have been proposed as a model of computation more powerful than classical Turing machines, based on their ability

Vint Cerf (5,287 words) [view diff] case mismatch in snippet view article find links to article

Center Cerf, Vinton (1972). Multiprocessors, Semaphores, and a Graph Model of Computation (PhD thesis). University of California, Los Angeles. OCLC 4433713032

Samuel Eilenberg (812 words) [view diff] exact match in snippet view article find links to article

theory and algebraic automata theory. In particular, he introduced a model of computation called X-machine and a new prime decomposition algorithm for finite

Lenore Blum (1,740 words) [view diff] exact match in snippet view article find links to article

Blum is also known for the Blum–Shub–Smale machine, a theoretical model of computation over the real numbers. Blum and her co-authors, Michael Shub and

Graphic matroid (2,283 words) [view diff] exact match in snippet view article find links to article

randomized expected time in a comparison model of computation, or in linear time in a model of computation in which the edge weights are small integers

Spectrum of a sentence (1,365 words) [view diff] exact match in snippet view article find links to article

it is a characterization of the class NP that does not invoke a model of computation such as a Turing machine. The theorem was proven by Ronald Fagin

Transdichotomous model (503 words) [view diff] exact match in snippet view article find links to article

Theoretical model of computation

Sequential access memory (184 words) [view diff] exact match in snippet view article find links to article

reference Streaming media difference between sequential and random access operations Turing machine model of computation sequential access memory v t e

Alexander Stepanov (567 words) [view diff] exact match in snippet view article find links to article

turning to C++, which Stepanov recognized early on, was that the C/C++ model of computation (which allows very flexible access to storage via pointers) is crucial

Longest common substring (1,063 words) [view diff] exact match in snippet view article find links to article

suffix tree. A faster algorithm can be achieved in the word RAM model of computation if the size σ {\displaystyle \sigma } of the input alphabet is in

Euclidean shortest path (681 words) [view diff] exact match in snippet view article find links to article

two dimensions, the problem can be solved in polynomial time in a model of computation allowing addition and comparisons of real numbers, despite theoretical

Cellular neural network (10,029 words) [view diff] no match in snippet view article find links to article

In computer science and machine learning, cellular neural networks (CNN) or cellular nonlinear networks (CNN) are a parallel computing paradigm similar

X-Machine Testing (2,893 words) [view diff] exact match in snippet view article find links to article

hardware testing that exploits the scalability of the Stream X-Machine model of computation. Using this methodology, it is likely to identify a finite test-set

Emil Leon Post (1,397 words) [view diff] exact match in snippet view article find links to article

1936, Post developed, independently of Alan Turing, a mathematical model of computation that was essentially equivalent to the Turing machine model. Intending

Snap! (programming language) (1,241 words) [view diff] exact match in snippet view article

mascot of Snap!, bears the name of Alonzo Church, the inventor of a model of computation in which a universal function, represented by lambda, can create

Mike Paterson (654 words) [view diff] case mismatch in snippet view article find links to article

Technology University of Warwick Thesis Equivalence Problems in a Model of Computation (1967) Doctoral advisor David Park Doctoral students Leslie Valiant

Guang Gao (846 words) [view diff] exact match in snippet view article find links to article

own research is to show that the fundamental value of the dataflow model of computation can be effectively explored and efficiently realized – and the superiority

Factorial (8,432 words) [view diff] exact match in snippet view article find links to article

algorithms may be analyzed using the unit-cost random-access machine model of computation, in which each arithmetic operation takes constant time and each

Production (computer science) (724 words) [view diff] exact match in snippet view article

structure rule Post canonical system (Emil Post's production systems- a model of computation.) See Klaus Reinhardt: Prioritatszahlerautomaten und die Synchronisation

Thread (computing) (4,052 words) [view diff] exact match in snippet view article

understandability, predictability, and determinism. Threads, as a model of computation, are wildly non-deterministic, and the job of the programmer becomes

Cons (901 words) [view diff] exact match in snippet view article find links to article

data structures in pure lambda calculus, an abstract, theoretical model of computation that is closely related to Scheme. This implementation, while academically

Convex polytope (3,271 words) [view diff] exact match in snippet view article find links to article

A matching lower bound is known in the algebraic decision tree model of computation. The task of computing the volume of a convex polytope has been studied

Structured analysis (2,863 words) [view diff] exact match in snippet view article find links to article

structured design, based on Martin and Estrin's "data flow graph" model of computation. It is common practice to draw a system context diagram first which

History of the Scheme programming language (2,021 words) [view diff] exact match in snippet view article find links to article

)" In November 1972, Hewitt and his students invented the Actor model of computation as a solution to the problems with Planner. A partial implementation

Plessey System 250 (1,304 words) [view diff] exact match in snippet view article find links to article

index register. The software was modular based on the universal model of computation and the lambda calculus. Six Church instructions hide the details

High-level language computer architecture (2,346 words) [view diff] exact match in snippet view article find links to article

Prolog coprocessor for superconductors. Like Lisp, Prolog's basic model of computation is radically different from standard imperative designs, and computer

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

operating at 0.1–5(+) kHz, using a time-triggered architecture (TTA) model of computation and communication. Hard real-time is possible at application level

Library of Efficient Data types and Algorithms (675 words) [view diff] exact match in snippet view article find links to article

a subset of optimization problems, and others under the real RAM model of computation rely upon real number parameters to produce accurate results. Boost

Dan Willard (1,055 words) [view diff] exact match in snippet view article find links to article

Willard changed these assumptions by introducing the transdichotomous model of computation. In this model, they showed that integer sorting could be done in

Randomized algorithm (4,218 words) [view diff] exact match in snippet view article find links to article

algorithm deterministic (e.g. randomized graph algorithms) When the model of computation is restricted to Turing machines, it is currently an open question

Dyson's eternal intelligence (726 words) [view diff] exact match in snippet view article find links to article

universal expansion continues to accelerate. Reversible computing – Model of computation in which all processes are time-reversible Supertask – Infinitely

Data model (5,059 words) [view diff] exact match in snippet view article find links to article

structured design, based on Martin and Estrin's "data-flow graph" model of computation. It is common practice to draw a context-level data-flow diagram

Ω-consistent theory (1,988 words) [view diff] exact match in snippet view article find links to article

multiplication). If T is strong enough to formalize a reasonable model of computation, Σ1-soundness is equivalent to demanding that whenever T proves that

Michael Shub (878 words) [view diff] exact match in snippet view article find links to article

Blum–Shub–Smale machine, an alternative to the classical Turing model of computation. Their model is used to analyse the computability of functions. From

Novikov self-consistency principle (3,446 words) [view diff] exact match in snippet view article find links to article

intermediate state. Physicist David Deutsch showed in 1991 that this model of computation could solve NP problems in polynomial time, and Scott Aaronson later

Convex hull algorithms (2,326 words) [view diff] exact match in snippet view article find links to article

{\displaystyle \Omega (n\log n)} time in the algebraic decision tree model of computation, a model that is more suitable for convex hulls, and in this model

Hidden-line removal (1,403 words) [view diff] exact match in snippet view article find links to article

read, exclusive write (CREW) parallel random-access machine (PRAM) model of computation. As the product of the processor number and the running time is asymptotically

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

and other problems through the nondeterministic constraint logic model of computation", Theoretical Computer Science, 343 (1–2): 72–96, arXiv:cs/0205005

Hidden Matching Problem (1,351 words) [view diff] exact match in snippet view article find links to article

advantage of over classical ones. Communication complexity is a model of computation first introduced by Yao in 1979. Two parties (normally called Alice

Linear programming (6,690 words) [view diff] exact match in snippet view article find links to article

admit a polynomial-time algorithm in the real number (unit cost) model of computation? This closely related set of problems has been cited by Stephen Smale

Kepler scientific workflow system (1,157 words) [view diff] exact match in snippet view article find links to article

in that it separates the structure of the workflow model from its model of computation, such that different models for the computation of the workflow can

QP (framework) (1,003 words) [view diff] exact match in snippet view article

The QP RTEFs are an implementation of the Active Object (Actor) model of computation, specifically tailored for real-time embedded (RTE) systems. Active

List of PSPACE-complete problems (1,807 words) [view diff] case mismatch in snippet view article find links to article

and Other Problems through the Nondeterministic Constraint Logic Model of Computation". arXiv:cs.CC/0205005. A. Condon, J. Feigenbaum, C. Lund, and P.

Adiabatic circuit (1,202 words) [view diff] exact match in snippet view article find links to article

and simple circuit designs get complicated. Reversible computing – Model of computation in which all processes are time-reversible Ballistic deflection transistor –

Pointer jumping (1,429 words) [view diff] exact match in snippet view article find links to article

node's direct successor. It is assumed, as in common in the PRAM model of computation, that memory access are performed in lock-step, so that each n.next

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

passing a name that points to P instead. The π-calculus is a universal model of computation. This was first observed by Milner in his paper "Functions as Processes"

Binary search (9,657 words) [view diff] exact match in snippet view article find links to article

of binary search is O ( 1 ) {\displaystyle O(1)} in the word RAM model of computation. The average number of iterations performed by binary search depends

List of pioneers in computer science (1,578 words) [view diff] exact match in snippet view article find links to article

verification. 1936 Post, Emil L. Developed the Post machine as a model of computation, independently of Turing. Known also for developing truth tables

Straight skeleton (2,179 words) [view diff] exact match in snippet view article find links to article

algorithms listed here are designed and analyzed in the real RAM model of computation. Aichholzer et al. showed how to compute straight skeletons of PSLGs

Widest path problem (3,017 words) [view diff] exact match in snippet view article find links to article

logarithm function, O(log*n), and the total time is O(m log*n). In a model of computation where each edge weight is a machine integer, the use of repeated

Universality probability (1,107 words) [view diff] exact match in snippet view article find links to article

concerns universal Turing machines. A Turing machine is a basic model of computation. Some Turing machines might be specific to doing particular calculations

Futures and promises (4,638 words) [view diff] exact match in snippet view article find links to article

described implicit futures, which are naturally supported in the actor model of computation and pure object-oriented programming languages like Smalltalk. The

Hadamard transform (4,739 words) [view diff] exact match in snippet view article find links to article

exactly like flipping a fair coin in the standard probabilistic model of computation. However, if the Hadamard gate is applied twice in succession (as

History of the Standard Template Library (788 words) [view diff] exact match in snippet view article find links to article

turning to C++, which Stepanov recognized early on, was the C/C++ model of computation that allows very flexible access to storage via pointers, which is

History of the Actor model (2,771 words) [view diff] exact match in snippet view article find links to article

building on the Logo work of Seymour Papert and the "little person" model of computation used for teaching children to program. However, the message passing

Euclidean algorithm (15,349 words) [view diff] exact match in snippet view article find links to article

implies that the total running time is also O(h). However, in a model of computation suitable for computation with larger numbers, the computational expense

Oblivious RAM (3,993 words) [view diff] exact match in snippet view article find links to article

{\displaystyle O(T(n)\log T(n))} . A more realistic model of computation is the RAM model. In the RAM model of computation, there is a CPU that can execute the basic

Nondeterministic constraint logic (1,691 words) [view diff] exact match in snippet view article find links to article

and other problems through the nondeterministic constraint logic model of computation", Theoretical Computer Science, 343 (1–2): 72–96, arXiv:cs/0205005

Kateryna Yushchenko (scientist) (1,350 words) [view diff] exact match in snippet view article

the study of algebraic grammar-methods of knowledge representation model of computation, and friendly user interface for designing and developing databases

Collective intelligence (15,320 words) [view diff] exact match in snippet view article find links to article

which we perceive as collective intelligence. Thus, a non-Turing model of computation is used. This theory allows simple formal definition of collective

Andrzej Grzegorczyk (2,886 words) [view diff] exact match in snippet view article find links to article

Weihrauch, Klaus (2011): Turing machines on represented sets, a model of computation for analysis. Logical Methods in Computer Science, Volume 7, Issue

Discovery Net (2,242 words) [view diff] exact match in snippet view article find links to article

representation language for workflow graphs supporting both a data flow model of computation (for analytical workflows) and a control flow model (for orchestrating

Procedural parameter (2,299 words) [view diff] exact match in snippet view article find links to article

by mathematician Alonzo Church, as part of his lambda calculus model of computation. Procedural parameters as a programming language feature were introduced

Krivine machine (1,911 words) [view diff] exact match in snippet view article find links to article

Theoretical model of computation

Joseph F. Traub (3,122 words) [view diff] case mismatch in snippet view article find links to article

Portfolio Management 22, 1995, 113–120 (with S. Paskov). A Continuous Model of Computation, Physics Today, May, 1999, 39–43. No Curse of Dimensionality for

Denotational semantics of the Actor model (3,346 words) [view diff] exact match in snippet view article find links to article

programming languages. One solution to this problem is to use the Actor model of computation. In Actor model, programs are Actors that are sent Eval messages

Massively parallel communication (797 words) [view diff] exact match in snippet view article find links to article

Karloff, Howard J.; Suri, Siddharth; Vassilvitskii, Sergei (2010), "A model of computation for MapReduce", in Charikar, Moses (ed.), Proceedings of the Twenty-First

Relational transducer (537 words) [view diff] exact match in snippet view article find links to article

Model of computation used in databases

Assembly (realizability) (1,552 words) [view diff] exact match in snippet view article

over a specific partial combinatory algebra, which abstracts the model of computation. It is a set equipped with an operation thought of as program execution

Reversible cellular automaton (9,018 words) [view diff] exact match in snippet view article find links to article

quantum dynamics. Quantum cellular automata were suggested as a model of computation by Feynman (1982) and first formalized by Watrous (1995). Several

Algorithm characterizations (8,991 words) [view diff] exact match in snippet view article find links to article

problem with respect to the random-access machine (RAM) abstract model of computation sometimes used in place of the Turing machine when doing "analysis

Sasikanth Manipatruni (7,193 words) [view diff] case mismatch in snippet view article find links to article

(2019). "Error-Resilient Spintronics via the Shannon- Inspired Model of Computation". IEEE Journal on Exploratory Solid-State Computational Devices and

Glossary of logic (30,237 words) [view diff] exact match in snippet view article find links to article

A self-operating machine or, in computer science, a theoretical model of computation that performs tasks according to a set of rules or a program. automorphism