The definition of the set of allowable operations used for computation and their respective costs. Some examples of models include Turing machines, recursive functions, lambda calculus, and production systems.
Questions tagged [computation-models]
500 questions
8
votes
5 answers
Why are progress bars so inaccurate?
Computers and programming languages tend to be deterministic and predictable. Yet progress bars seem the opposite, especially if the operation is complex. Even for world class professional products, some progress bars do little to reflect the real…
Paul Uszak
- 1,602
- 1
- 13
- 21
6
votes
3 answers
why is this computational method by Knuth "effective" and "powerful"?
This is a follow-up question regarding Knuth's one formulation of the concept of an algorithm here. I am asking it here because I do not have enough reputation to post a comment to that question. To make my question self-contained, here it…
user14586
4
votes
0 answers
The cost of memory allocation on the (tacitly assumed) Word RAM machine?
Consider a particular algorithm that solves the binary search problem (or similar stuff) by performing $\sqrt{n}$ simple operations on numbers of
$\log(n)$ bits. Suppose this algorithm works on a Word Ram machine with
word size $w=\log(n)$. What…
Daniel Porumbel
- 271
- 1
- 6
3
votes
1 answer
What's the difference between transdichotomous model and RAM?
In Wikipedia, it says
the transdichotomous model is a variation of the random access machine in which the machine word size is assumed to match the problem size.
However, a random access machine is by definition a register machine, whose registers…
xskxzr
- 7,455
- 5
- 23
- 46
3
votes
1 answer
Is modulus capable of universal computation?
I heard once that you could translate any digital circuit into a modulus operation, perhaps modulusing against different numbers?
It was a long while ago though and don't remember where I heard it.
Is this true or does it ring any bells?
Alan Wolfe
- 1,358
- 10
- 21
3
votes
3 answers
What motivates the RAM model?
It looks like most of today's algorithm analysis is done in models with constant-time random access, such as the word RAM model. I don't know much about physics but from popular sources I've heard that there's supposed to be a limit on information…
acupoftea
- 458
- 3
- 10
3
votes
1 answer
Is "represents" a symmetric relation in the provided answer to TAOCP exercise 1.1.9?
In exercise 1.1.9 of volume 1 of The Art of Computer Programming, the reader is asked to
formulate a set-theoretic definition for the concept "$C_2$ is a representation of $C_1$"
where $C_1$ and $C_2$ are computational methods described in the…
Reepca
- 181
- 3
2
votes
1 answer
SIMD computational model
Flynn's taxonomy contains three interesting computer architectures: SISD, SIMD, MIMD.
For the SISD architecture, we have RAM computational model that simulate real SISD systems very well;
For the MIMD architecture, there is PRAM computation model…
Nikita Sivukhin
- 151
- 6
2
votes
0 answers
Reference/textbook on RAM model/model of computation for algorithms
Can someone recommend a reference/textbook on the RAM model of computation? Preferably something with a concise definition and doesn't get too much into computer architecture. I'm very fine with this is the RAM model this is how much time space,...…
user122938
- 21
- 2
2
votes
0 answers
A simple, concise, strong and a formal model of computation
Most mathematical objects can be said to be defined in simple terms, are usually really concise and still manage to capture the essence of what they are trying to talk about. For example, topology does a great job at capturing a broad and variety of…
nir shahar
- 11,538
- 3
- 14
- 35
2
votes
1 answer
Programming languages and Model of computations
I am learning about model of computation and I found this wikipedia entry that categorises and outlines various model of computation.
Now I want to know the programming languages that builds on these models.
I am aware that functional programming…
Finlay Weber
- 145
- 4
2
votes
0 answers
Restrictions on Computational Methods (Art of Computer Programming)
In the Art of Computer Programming, Knuth describes a computational method as a quadruple $(Q, I, \Omega, f)$ where $I, \Omega \subseteq Q$, $\Omega$ is pointwise fixed, and each $x \in I$ defines a sequence $x_0, x_1, x_2, \ldots$ such that $x_0 =…
Tarang Saluja
- 123
- 4
1
vote
1 answer
Is there a model of computation based on discrete event dynamic systems?
I asked a question here about discrete event dynamic systems. They are systems whose state evolution depends on asynchronous events. It can be combined with flow to produce a hybrid system.
There must be an event-based model of computation, since it…
user56834
- 3,722
- 4
- 18
- 32
1
vote
1 answer
An axiomatic theory of computational models?
There are many different computational models, e.g. Turing machines, register machines, lambda calculus, etc.
I am wondering if there exists an axiomatization of computation, that abstracts away from the specifically constructed computational…
user56834
- 3,722
- 4
- 18
- 32
1
vote
1 answer
Register model of computation
It consists of one read only input memory and write only output medium. The computation proper takes place in a working memory of limited size. When stating that a problem can be solved with a certain number of bits, what we mean is that the working…
Complexity
- 1,187
- 9
- 23