Skip to main content

Questions tagged [simulation]

Questions about simulating one model in another. This includes simulating reality in any model, or simulating a machine model with Turing machines.

Filter by
Sorted by
Tagged with
3 votes
0 answers
24 views

Fastest possible (direct?) simulation of one tape turing machines by a small one tape Universal Turing Machine

The paper The complexity of small universal Turing machines: a survey (.pdf) includes the following chart of the then (2011) smallest known Universal Turing Machines. The ones marked as rectangles ...
2080's user avatar
  • 201
0 votes
0 answers
17 views

When does Simulation Equivalent imply Bisimulation

Here, Given 2 Kripke structures M1 and M2, if there exists a simulation from M1 to M2 and a simulation from M2 to M1, is there a bisimulation from M1 to M2?, it is shown that for two LTSs M1 and M2 ...
revision's user avatar
0 votes
1 answer
27 views

Thread safety due to no runtime allocation of memory, why?

I was watching a presentation related to the MuJoCo simulator (and other topics which were more relevant for the presentation itself) and at one moment in the presentation it is mentioned that MuJoCo ...
pdaranda661's user avatar
0 votes
0 answers
8 views

What Quantitative Evaluation Methods Should Be Used for Robotics Simulation Research?

Research on Photorealistic 3D Virtual Environments for Robotics Background I am engaged in a robotics research project focusing on the development and evaluation of photorealistic 3D virtual ...
assa's user avatar
  • 1
1 vote
1 answer
48 views

Complexity of simulations in simulations

This video of a group, who simulated (a very simple version of) Minecraft inside Minecraft itself got me thinking about the performance of such setups. Another example to what I'm referring to, would ...
SmallestUncomputableNumber's user avatar
2 votes
1 answer
111 views

State Machines as Functors

I'm looking for more examples of the following model of state machines: in David Spivak's book on category theory, he gives in section 3.1.2.10 and in application 4.3.1.9, a description of a finite ...
NathanLiitt's user avatar
1 vote
0 answers
33 views

Learn computer architecture and organisation via an oversimplified machine

I wish to learn CO&A (computer organisation and architecture) from scratch via some toy system and its simulator. I found the following resource: Toy Machine developed at Princeton University. Toy ...
anurag's user avatar
  • 111
0 votes
1 answer
130 views

What is the most efficient way to represent an directed dynamic massive 3D graph?

I know that there are many techniques to represent graphs. Suppose I have a directed massive 3D graph with 100,000 nodes at maximum. Suppose the graph looks somewhat like the following: Suppose each ...
user366312's user avatar
1 vote
1 answer
141 views

How to simulate a Discrete Event Simulation model with a real-time server?

My Problem is having to work with real-time server in a DES model. I have the following situation: I want to build a discrete event simulation model (Using event scheduling world view). However, this ...
M. Pour's user avatar
  • 113
4 votes
0 answers
51 views

Are there any probabilistic models of computation that can strongly simulate themselves?

I was reading this question over on the quantum computation stackexchange, and the top answer stated that you can't (strongly) simulate even a probabilistic turing machine, on itself. I was just ...
Loic Stoic's user avatar
2 votes
2 answers
54 views

Can all non-quantum physical systems be efficiently simulated on a classical computer?

Is it true that simulating classical physical systems is in P, i.e. can be done efficiently on Turing machines or are there known exceptions? I'm thinking of chaotic systems but I'm also curious more ...
Würthi's user avatar
  • 151
0 votes
0 answers
40 views

are computer errors inevitable?

this is my First post,I apologize for my ignorance. The question is: Could a programmer (human or Ai) with all the computing power and infinite time create a simulation of a world with our same laws ...
Zeruel017's user avatar
1 vote
1 answer
192 views

Prove the equivalence of the modified Turing Machines and the standard Turing Machines

We have a Turing Machine that cannot write the same symbol it has read in a transition, meaning it should always alter the symbol when passing it. How can we prove that such machines have equal ...
Pouriyatajmehrabi's user avatar
0 votes
1 answer
108 views

Are sample memory access traces/dumps available, and where?

I am looking for a realistic physical memory access trace/dump of significant, but not insane, length (on the order of 1M accesses) for the purpose of cache simulation. Preferably for a 16-bit or 32-...
DYZ's user avatar
  • 111
1 vote
1 answer
440 views

A turing machine L takes a machine <M> which has to halt at for least n Inputs

I've been wondering about this problem for a while: Say we have L = { <M>, n | M has to halt for at least n Inputs} and multitapes are simulating various inputs bla bla How do I count how many ...
Shionanono's user avatar
2 votes
1 answer
424 views

Are Nondeterministic Finite Automata not allowed 'sink-states'?

By definition are Nondeterministic Finite Automata not allowed a 'sink-state' (non-accepting state we don't get out of)? I can see us having them for NFA but not necessary but do not see how they are ...
rocktarmadeyah's user avatar
0 votes
0 answers
28 views

Looking for a multi-processor job scheduling strategy simulator

I hope this is the appropriate Stack Exchange site for questions like this. Recently, a college student and I are looking for a robust software for simulating job scheduling in multi-processor ...
marcelovca90's user avatar
2 votes
0 answers
51 views

What was the original paper that showed a simulation of turing machines via circuits?

It is a very standard construction in most complexity theory courses to turn a turing machine into a circuit. I thought this was due to Cook, but it looks like he did the reduction to SAT not through ...
exfret's user avatar
  • 352
-2 votes
1 answer
118 views

How can I convert a Grammar to NFA?

Hello I have a task where I´m stucking at. I have to convert a Grammar to NFA. I have these information: G=(V,T,P,S) V={S}, T{0} and S -> 0S S -> 0 I can´t ...
grammartest's user avatar
-8 votes
4 answers
561 views

Does the Linz Ĥ applied to ⟨Ĥ⟩ correctly transition to its final reject state?

...
polcott's user avatar
  • 85
-9 votes
1 answer
637 views

Are the halting problem proofs refuted by software engineering?

Can D simulated by H terminate normally? The x86utm operating system based on an open source x86 emulator. This system enables one C function to execute another C function in debug step mode. When H ...
polcott's user avatar
  • 85
2 votes
0 answers
61 views

What algorithm to use for substractive machining RT simulation?

For a CAM (Computer Aided Manufacturing) software, and more specifically, for the simulation of the subtractive manufacturing, I would like to understand how to design the representation. In ...
Adrian Maire's user avatar
2 votes
0 answers
36 views

What would you do if the author of a published CS article does not respond to code requests? [closed]

Since reproducibility is a major principle or basic norm of scientific experiments, simulations, and computations, what would you do or what to do if the author of a published CS article does not ...
cser's user avatar
  • 21
2 votes
0 answers
47 views

Understanding the simulate of an IF loop program through a LOOP program

We have the following operation $\text{IF} \ x_i =0 \ \text{THEN} \ P \ \text{END}$. I want to simulate this using a $\text{LOOP}$ program. Here is what I have: $$\text{IF} \ x_i = 0 \ \text{THEN} \ P ...
Ski Mask's user avatar
  • 463
1 vote
1 answer
341 views

Is NP in NP/Poly?

The answer is yes, NP/poly is defined as the class of problems solvable in polynomial time by a non-deterministic Turing machine that has access to a polynomial-bounded advice function--the advice ...
DeeDee's user avatar
  • 365
-1 votes
1 answer
41 views

single circuit simulating multiple Turing machines

You can simulate polynomial time Turing machines with polynomial size circuits, can you simulate multiple poly time TMs with a single poly size circuit?
DeeDee's user avatar
  • 365
0 votes
1 answer
74 views

Is there any hope for real "simulated machines" in our lifetime?

Without going into details about my life's story, here's the basic facts: I grew up with 386 and 486 and Pentium PCs running MS-DOS 5 (I believe), Windows 3.1 and Windows 95, a well as various game ...
V. Arquines's user avatar
1 vote
0 answers
69 views

Why does a kalman filter work better in a simulation than in real life?

I am trying to use a classical Kalman filter for getting indoor location. I am using geolocation API of HTML to get latitude, longitude, position accuracy and speed. I am also using the smartphone's ...
Dhanraj Mahurkar's user avatar
0 votes
2 answers
86 views

Are objects appropriate for modeling the real world?

First of all, I know objects are not meant to model the real world, although they have been marketed as such and perhaps that was an intention at some point. Here I say 'modeling the real world' in a ...
Piovezan's user avatar
  • 113
0 votes
1 answer
1k views

What is the difference between a simulator, emulator, and cross compiler?

As far as I understand, cross compilers, emulators, and simulators are all ways that one computer system to be able to behave like or run another computer system. What is the difference between these ...
aniket ambekar's user avatar
0 votes
0 answers
71 views

Creating An Artificial Universe

This is a general question and one that has bugged me for a long time. I want to start working on an artificial universe, not something too ambitious but more of a basic concept. What I have in mind ...
Rookie's user avatar
  • 11
0 votes
2 answers
143 views

What subfields in computer sciences may one study without learning Object Oriented Programming?

What subfields in computer sciences may one study without learning Object Oriented Programming or is there some kind of degree in Computer Science without the OOP knowledge requirement? Is there a ...
Muon3pi's user avatar
0 votes
1 answer
53 views

Encoding huge number of tape-symbols of a turing machine in the simulation of the turing-machine using real computer

I was going through the classic text "Introduction to Automata Theory, Languages and Computation" by Hopcroft,Ullman,Motwani where I came across the simulation of a turing machine using a real ...
Abhishek Ghosh's user avatar
1 vote
1 answer
990 views

Queries regarding simulation of multi-tape turing machine using single tape turing machine

I was going through the classic text "Introduction to Automata Theory, Languages, and Computation" by Jeffrey Ullman,John Hopcroft and Rajeev Motwani, where I came across the simulation of MULTI-TAPE ...
Abhishek Ghosh's user avatar
0 votes
0 answers
105 views

Regular grammars

I am fairly new to automata, regular expressions and regular grammar. I am struggling to understand how to define the regular expression (abc)* into one or several regular grammar expressions. ...
Dusan Biga's user avatar
1 vote
1 answer
361 views

Priority Queue Using Stack

Can one build a priority queue using stacks, such that the priority queue has the same complexity for each operation. Could it be done? If so how? If not what is the best solution that can be done? ...
newhere's user avatar
  • 101
0 votes
2 answers
214 views

Does the callback concept of programming have any basis in computer science?

Although I seriously code with computer languages in general since 2010 and as an amateur programmer with programming languages in particular since 2015 (primarily Bash and JavaScript imperative ...
user avatar
2 votes
2 answers
134 views

Does the pigeonhole principle rule out the possibility of losslessly simulating a universe the size of our own?

Say you had a very powerful computer and wanted to run a completely lossless simulation of a universe approximately the same size as our own: $10^{80}$ particles. Each particle in the simulation has ...
Greg Lane's user avatar
0 votes
1 answer
172 views

Prof Knuth's MIX computer - Card Reader and illegal characters

I'm reading through Knuth's "The Art of Computer Programming" volume 1 (3rd edition), with the goal of understanding the complete workings of his hypothetical MIX computer in order to implement MIX in ...
Wossname's user avatar
  • 103
2 votes
1 answer
374 views

Why can’t you simulate a Turing machine with a one-stack PDA by messing with the stack?

I have heard that a matrix can be modeled as just an one array by declaring increasingly large spaces to be from the second array, and that the least you need for a Turing machine is just a PDA with ...
JohnnyApplesauce's user avatar
1 vote
1 answer
130 views

Simulations between Turing machines

I've got a question. How can i simulate Turing machine with a double-sided infinite tape by a Turing machine with one-sided infinite tape? The condition is, that the simulation of one step of the ...
stepanVich's user avatar
0 votes
1 answer
473 views

How would one simulate the law of conservation of energy?

I'm new to computer science, but I've studied physics for a while. I'm just curious, if one wanted to make a simulation of the law of conservation of energy, on a large scale, how would it be done? ...
Oisin Spain's user avatar
3 votes
1 answer
234 views

Is it reasonable to model row buffers in DRAM corresponding to the same bank ID as one big row buffer?

I'm creating a simple row buffer simulator to go along with a simple cache simulator in order to count hits and misses in the row buffer. Whenever a cache block isn't in the cache I want to go look ...
JustAnotherUser's user avatar
3 votes
1 answer
164 views

Why do we simulate the universal TM to simulate another TM M instead of simulating M directly?

In the proof of the time hierarchy theorem given on page 69 of Arora-Barak, we define a TM D as follows: "On input $x$, run for $|x|^{1.4}$ steps the Universal TM $\ \mathcal{U}$ of Theorem 1.9 to ...
Johnny's user avatar
  • 363
1 vote
0 answers
40 views

How to improve convergence to an equilibrium value, & damp oscillation?

I am developing a program which seeks strategies for the players A, B in any of a family of simple 2-player gambling-games. The program iterates, using a genetic algorithm to determine, from the ...
Rosie F's user avatar
  • 111
1 vote
0 answers
141 views

MAX-CUT: are there any algorithms or codes for classical computers, that cater to this specific case?

A paper was published recently in Science where the authors minimized the following function: $$E_{\text{Ising}}(s) = -\dfrac{1}{2} \Sigma_{i=1}^{N} \Sigma_{j=1}^{N} J_{i,j} s_i s_j,$$ where $s_i$ ...
Nike Dattani's user avatar
1 vote
1 answer
1k views

Prove Halting on all Inputs is not in RE simulation

I don't understand why when proving if Halting on all inputs problem si not in RE using the complement of the halting problem, I have to take a turing machine and simulate the machine M(the machine ...
Xyz's user avatar
  • 13
1 vote
0 answers
248 views

How can an arbitrary Turing machine running for $t$ steps be simulated in $O(n \log(n))$ steps?

I'm confused about a point regarding the Time Hierarchy Theorem. In order to establish the upper bound for this theorem it's necessary to show the following: We're given $(\langle M \rangle, t)$ ...
Sebastian Oberhoff's user avatar
2 votes
0 answers
946 views

Equivalence between different Turing Machines and a definition of simulation

Im having some difficulty understanding how the following two concepts could be related. Equivalence between TMs as is commonly tought According to this site answer, to prove a standard TM model to ...
fulem's user avatar
  • 21
1 vote
1 answer
124 views

Why the universal Turing machine simulation in O(TlogT) cannot be applied to transform multi-taped Turing machine into single-taped?

Recently, I've read Hennie's Paper. I understood the construction of buffer zones, but why can't it be applied to yield a single-taped Turing machine?
user avatar