-
1 Virtual Machine
wo programs can be thought of as strongly equivalent or as different realizations of the same algorithm or the same cognitive process if they can be represented by the same program in some theoretically specified virtual machine. A simple way of stating this is to say that we individuate cognitive processes in terms of their expression in the canonical language of this virtual machine. The formal structure of the virtual machine-or what I call its functional architecture-thus represents the theoretical definition of, for example, the right level of specificity (or level of aggregation) at which to view mental processes, the sort of functional resources the brain makes available-what operations are primitive, how memory is organized and accessed, what sequences are allowed, what limitations exist on the passing of arguments and on the capacities of various buffers, and so on. (Pylyshyn, 1984, p. 92)Historical dictionary of quotations in cognitive science > Virtual Machine
См. также в других словарях:
Algorithm characterizations — The word algorithm does not have a generally accepted definition. Researchers are actively working in formalizing this term. This article will present some of the characterizations of the notion of algorithm in more detail. This article is a… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Algorithm examples — This article Algorithm examples supplements Algorithm and Algorithm characterizations. = An example: Algorithm specification of addition m+n =Choice of machine model:This problem has not been resolved by the mathematics community. There is no… … Wikipedia
Algorithm — An ISO term. A specified mathematical process for computation. A sequence of steps to be followed to perform a task. Most often used when talking about computer programming … International financial encyclopaedia
Generic cell rate algorithm — The generic cell rate algorithm (or GCRA) is an algorithm which measures cell rate at a specified timescale [#REF| [1] . The GCRA is an implementation of the leaky bucket algorithm in ATM networks, and provides a traffic shaping function [#REF|… … Wikipedia
K-means algorithm — The k means algorithm is an algorithm to cluster n objects based on attributes into k partitions, k < n. It is similar to the expectation maximization algorithm for mixtures of Gaussians in that they both attempt to find the centers of natural… … Wikipedia
Integer relation algorithm — An integer relation between a set of real numbers x 1, x 2, ..., x n is a set of integers a 1, a 2, ..., a n, not all 0, such that:a 1x 1 + a 2x 2 + cdots + a nx n = 0.,An integer relation algorithm is an algorithm for finding integer relations.… … Wikipedia
Tarjan's off-line least common ancestors algorithm — In computer science, Tarjan s off line least common ancestors algorithm is an algorithm for computing lowest common ancestors for pairs of nodes in a tree, based on the union find data structure. The least common ancestor of two nodes d and e in… … Wikipedia
Criss-cross algorithm — This article is about an algorithm for mathematical optimization. For the naming of chemicals, see crisscross method. The criss cross algorithm visits all 8 corners of the Klee–Minty cube in the worst case. It visits 3 additional… … Wikipedia
Randomized algorithm — Part of a series on Probabilistic data structures Bloom filter · Skip list … Wikipedia
Page replacement algorithm — This article is about algorithms specific to paging. For outline of general cache algorithms (e.g. processor, disk, database, web), see Cache algorithms. In a computer operating system that uses paging for virtual memory management, page… … Wikipedia
