Questions tagged [machine-models]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
7 votes
1 answer
113 views

Is the following restriction of cellular automata / tile assembly / CRN a known model?

Consider the following model: we work in the $d$-dimensional grid $\mathbb{N}^d$, and we have an alphabet $\Sigma$. The initial cell $(0,\ldots,0)\in \mathbb{N}^d$ is marked with some letter $\Sigma$, ...
user avatar
  • 5,261
3 votes
2 answers
143 views

Looking for some lecture videos on logic, models of computation and computational complexity/tcs fundamentals [closed]

Looking for some lecture videos (introductory level) on logic, models of computation as well as computational complexity/ other theoretical computer science fundamentals
user avatar
  • 217
14 votes
1 answer
850 views

Are there languages decidable in linear time by RAM machines that have superlinear time complexity lower bounds for Multitape Turing machines?

Question: Are there languages decidable in linear time by RAM machines that have superlinear time complexity lower bounds for Multitape Turing machines? Background: I recently stumbled upon the ...
user avatar
6 votes
2 answers
362 views

On the complexity of a "list" datastructure in the RAM model

I am interested in the complexity of a data-structure equipped with the following operations (similar to a list): insertion of an element at a given position within the list deletion of an element at ...
user avatar
  • 685
1 vote
1 answer
93 views

Running an algorithm for fixed amount of time on RAM model machine

Suppose there is a deterministic algorithm of size $O(1)$ that operates on an input of size $N$ on a RAM model machine. I want to run the algorithm for $O(\sqrt{N})$ time, pause the algorithm, print "...
user avatar
  • 1,015
2 votes
0 answers
96 views

How fast can we perform DFT on a Log-RAM computer?

The question is how fast we can perform an $n$ coefficient discrete Fourier transform on the log-RAM model of computation. If we assume that we can do arithmetic operations on registers of size $\log{...
user avatar
  • 2,080
1 vote
3 answers
435 views

what is a model of computation, mathematically? [closed]

Where can I find a mathematical definition for "model of computation"? https://en.m.wikipedia.org/wiki/Model_of_computation doesn't provide a precise definition for "model of computation"--it doesn't ...
user avatar
  • 291
3 votes
0 answers
531 views

Convention for RAM machine models

When algorithm asymptotic runtimes are given without explicitly noting the computational model, what is the convention for the exact model used? My understanding is that most problems use unit-cost ...
user avatar
7 votes
2 answers
396 views

Most general setting for fine-grained exponential-time complexity classes?

Consider the class of functions computable in time $(b+o(1))^n = 2^{\log_2{(b)} \times n + o(n)}$ on a $2$-tape Turing machine. By the Hennie-Stearns theorem, the same functions are computable in ...
user avatar
7 votes
1 answer
358 views

Examples of quasilinear vs. essentially linear time translatable models

The Hennie-Stearns theorem says that $k$-tape Turing machines with $k \ge 2$ are intertranslatable with loglinear blowup ($O(t \times \log{(t)}$). This would define an equivalence class of models, ...
user avatar
11 votes
2 answers
415 views

Are there protein-based computational models?

Is there a framework/formalism that defines computational models based on proteins other than Adleman's DNA model or this work by Cherry and Qian? Edit 2020 (related models/ideas based on DNA): DNA ...
user avatar
  • 463
7 votes
3 answers
558 views

Where does the modern canonical version of the Turing machine come from?

Turing's original 1936 description of his a-machine differs in several respects from the Turing machine I studied at university, leading me to questions: The Turing machine I learned about was ...
user avatar
4 votes
2 answers
234 views

Characterisation of P in terms of register machines

It is a well-known result that Turing machines and random access machines (RAMs) can simulate each other with a polynomial slowdown. It is relatively straightforward to prove that indirect addressing ...
user avatar
3 votes
0 answers
146 views

Is there research on "minimal" Turing-universal Markov algorithms?

The Markov algorithm is a simple model of computation. For other models of computation, such as Turing machines, cellular automata, tag systems, etc., there is research on the "minimal" instances of ...
user avatar
  • 679
4 votes
1 answer
224 views

Implications of $\mathsf{P}\neq\mathsf{NP}$ in $\mathsf{BSS}$ model

What are implications of $\mathsf{P}\neq\mathsf{NP}$ in $\mathsf{BSS}$ model to $\mathsf{Turing}$ model and $\mathsf{Valiant's}$ counting complexity model? In opposite direction what are implications ...
user avatar
7 votes
0 answers
147 views

What can you do with a moving knife besides cutting a cake?

In the fair cake-cutting, two different computational models are used: A discrete model, in which the algorithm issues queries to the players and proceeds according to their replies; A continuous ...
user avatar
6 votes
1 answer
138 views

What is the state of the art research in analysing algorithms on GPU architectures?

I have found many papers on sequential algorithms that have been implemented and tested on GPU architectures. Each of these papers usually as a result contains the amount of speedup that was achieved ...
user avatar
  • 171
0 votes
0 answers
84 views

Understanding MA protocol as a variant of TM for small space setting

MA protocol is one of the most basic models of interactive proofs. Merlin is a prover sending a witness $w$ for given input string $x$, and Arthur is a verifier who verifies if $w$ is a positive ...
user avatar
  • 1
1 vote
0 answers
86 views

Implication of lower bounds in Boolean circuit to other models of computation

Suppose that one can prove that some hard function $f$ with $n$ bit input does not admit any Boolean circuit of size at most $n^t$. Then, how strong can we say about how hard $f$ is in other models? ...
user avatar
  • 1,120
13 votes
3 answers
594 views

Reversible Turing tarpits?

This question is about whether there are there any known reversible Turing tarpits, where "reversible" means in the sense of Axelsen and Glück, and "tarpit" is a much more informal concept (and might ...
user avatar
  • 679
13 votes
2 answers
619 views

Provable gaps between decision tree complexity and "true" complexity

The title is a little misleading: but hopefully the question isn't: Grønlund and Pettie's new result showing that 3SUM has only $O(n^{3/2})$ decision tree complexity got me wondering: Is there a ...
user avatar
0 votes
0 answers
74 views

Machine models based on group-labeled digraphs?

Following an earlier question, I would like to suggest the following generic computation model. Let $\Gamma$ be a group, we say that a $\Gamma$-labeled digraph is a digraph $G$ whose arcs are labeled ...
user avatar
  • 1,292
3 votes
2 answers
270 views

Difference between abstract machines and calculi

So, first of all: I'm not sure how to tag this question. Feel free to tag it differently. I recently started reading up on CHAMs, which can express different process calculi. Slightly confused, I go ...
user avatar
  • 605
5 votes
2 answers
300 views

Why do we need PAP (partial aplication) objects in heap?

In the paper “Making a Fast Curry: Push/Enter vs. Eval/Apply for Higher-order Languages” by Simon Marlow and Simon Peyton Jones it is told that a PAP heap object may be created in the push/enter model ...
user avatar
  • 557
14 votes
1 answer
684 views

Complexity class associated with exhaustive search

What is the complexity class associated with exhaustive search algorithms? (if there is one) Is it NP or PSPACE? Are there restricted models of computation capturing the class of exhaustive search ...
user avatar
  • 3,993
1 vote
3 answers
757 views

Does mathematical model for conccurent computations exist?

Turing machines can represent any computation. Can they also represent concurrent computations? Eg. multiple computations that can happen at the same time? If yes, how are the concurrent computations ...
user avatar
  • 121
8 votes
0 answers
171 views

Cell probe model vs transdichotomous ram

can someone explain me the difference between those two (cell probe model and transdichotomous ram)? In cpm I'm allowed to do computation for free, and complexity of algorithm is just a number of ...
user avatar
  • 81
6 votes
6 answers
2k views

Was the reason that Computers were invented to solve a philosophical question about the foundations of mathematics?

This guy asserts: I’ll say it — the computer was invented in order to help to clarify … a philosophical question about the foundations of mathematics. (This problem being Entscheidungsproblem - ...
user avatar
  • 2,501
13 votes
3 answers
746 views

Can any program be implemented mechanically?

Is it possible to build a single purpose (non Turing complete) mechanical implementation of say, Microsoft Word? Is it possible to implement such things as iterators, first-order functions, the whole ...
user avatar
  • 199
-3 votes
1 answer
813 views

Minimal Turing Machine implementation / Von Neumann UC [closed]

I've written a small python program which implements a Turing Machine with a finite tape. It has a tape, a head, a state register and a set of transfer functions ("the program"). The difference to a ...
user avatar
  • 111
39 votes
7 answers
7k views

Applicability of Church-Turing thesis to interactive models of computation

Paul Wegner and Dina Goldin have for over a decade been publishing papers and books arguing primarily that the Church-Turing thesis is often misrepresented in the CS Theory community and elsewhere. ...
user avatar
  • 825
17 votes
1 answer
2k views

Feasibility of Gödel machines

Recently I stumbled upon quite an interesting theoretical construct. A so called Gödel machine It's a general problem solver which is capable of self-optimization. It's suitable for reactive ...
user avatar
2 votes
2 answers
401 views

Difference between Stencil -structures and Cellular Automata Category-theoretically?

Definitions Stencil = "For a given point, a stencil is a pre-determined set of nearest neighbors (possibly including itself)." (source) Wikipedia's definition (source) = It looks ...
user avatar
  • 71
7 votes
2 answers
379 views

Which model of computation to simulate to prove universality?

I am starting out in theoretical computer science. I have a model of computation based on observations of auto-associative memory in the brain. I believe (with little evidence) that I can do ...
user avatar
  • 825
28 votes
0 answers
488 views

Adiabatic quantum computing with level crossings

Question. In adiabatic evolution, to ensure that the ground state high overlap with the unique ground state of the system (i.e. to achieve arbitrarily small error) using adiabatic theorems, it is ...
user avatar
5 votes
4 answers
864 views

Examples of reversible computations

Irreversible computations can be intuitive. For example, it is easy to understand roles of AND, OR, NOT gates and design a system without any intermediate, compilable layer. The gates can be directly ...
user avatar
  • 431
1 vote
0 answers
177 views

What is the the optimal computational model for memristive style CMOS?

I'm a bit new to the practical use of memristors in general, but I'm starting to see it as a (3D stacked) grid of components that could be treated as transistors or flip-flops on demand (which may be ...
user avatar
3 votes
1 answer
192 views

Prefix Dictionary Problem in External Memory

I'm interested in an external memory data structure able to support the following operations on variable length binary sequences: (1) Insert such a sequence. (2) Given a query sequence, find the ...
user avatar
11 votes
3 answers
596 views

Is the MapReduce framework a type of BSP?

Is it accurate to call the mapReduce framework a type of bulk synchronous parallel programming framework with no local memory retention within processors between synchronizations? If not, what ...
user avatar
20 votes
3 answers
570 views

What is the right theoretical model to design algorithms for current and upcoming high performance computers

This question is similar to a more general question for what is the right theoretical model of a computer to design algorithm and data structures in. Here, I ask specifically about current high ...
user avatar
9 votes
5 answers
547 views

Natural computation based on fundamental forces

Well-known examples of computation inspired by natural phenomenon are quantum computers and DNA computers. What is known about the potential and/or limitations of computing with Maxwell's laws or ...
user avatar
1 vote
1 answer
592 views

Assistance in showing computational equivalence between software and hardware computing systems

I'm in the middle of a discussion regarding the equivalence of software and hardware computing systems, and I would like some comment. Any arguments and/or documentation (supporting or dissenting) ...
user avatar
14 votes
6 answers
486 views

What is known about the effectiveness of reliable computing?

How well has the following problem been investigated in TCS? (I apologize if the problem statement sounds vague!) Given a Model of Computation MC (Turing Machine, Cellular Automata, Kolmogorov-...
user avatar
  • 387
16 votes
2 answers
4k views

Time complexity of Bellman-Held-Karp algorithm for TSP, take 2

A recent question discussed the now-classical dynamic programming algorithm for TSP, due independently to Bellman and Held-Karp. The algorithm is universally reported to run in $O(2^n n^2)$ time. ...
user avatar
  • 22.8k
7 votes
0 answers
360 views

Are there any models of computation currently being studied with the possibility of being more powerful than Turing Machines? [duplicate]

Possible Duplicate: What would it mean to disprove Church-Turing thesis? Are there any models of computation currently being studied with the possibility of being more powerful than Turing ...
user avatar
15 votes
0 answers
1k views

Can a Penrose tile cellular automaton be Turing-complete?

This question was based on an incorrect premise ... see Colin's comment below. Forget it. This was inspired by the discussion on this Math Overflow question. First, I need to define our terms. In a ...
user avatar
41 votes
6 answers
3k views

Which model of computation is "the best"?

In 1937 Turing described a Turing machine. Since then many models of computation have been decribed in attempt to find a model which is like a real computer but still simple enough to design and ...
user avatar
2 votes
1 answer
335 views

Decide if number is negative (in URM machine like language)

So I'm learning to program in an assembly language for an abstract machine wich is very similar to an URM Machine. An URM machine has 3 basic instructions (or 4 in some literature): To zero a ...
user avatar
11 votes
1 answer
457 views

Do people look at loop nestness in boolean circuits?

While an EE undergrad I attended some lectures that presented a nice characterization of boolean circuits in terms of how many nested loops they have. In complexity, boolean circuits are often thought ...
user avatar
  • 4,746