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.
178
questions
1
vote
1
answer
37
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 ...
2
votes
1
answer
61
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 ...
1
vote
0
answers
17
views
definition of P-samplable distribution that allows non-binary fractions
Arora and Barak (in chapter 18, on average-case complexity) define a polynomial-time samplable (or P-samplable) distribution $D$ (actually a family $\{D_n\}$, for each output length $n$) as having an ...
1
vote
0
answers
29
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 ...
0
votes
1
answer
101
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 ...
1
vote
1
answer
88
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 ...
4
votes
0
answers
49
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 ...
1
vote
2
answers
41
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 ...
0
votes
0
answers
38
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 ...
1
vote
1
answer
169
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 ...
0
votes
1
answer
82
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-...
1
vote
1
answer
269
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 ...
2
votes
1
answer
308
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 ...
0
votes
0
answers
27
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 ...
2
votes
0
answers
48
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 ...
-2
votes
1
answer
95
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 ...
-8
votes
3
answers
507
views
Does the Linz Ĥ applied to ⟨Ĥ⟩ correctly transition to its final reject state?
Applying a Simulating Halt Decider to the Linz Halting Problem Proof
A simulating (at least partial) halt decider correctly predicts whether or not its correctly simulated input can possibly reach its ...
-9
votes
1
answer
608
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 ...
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 ...
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 ...
2
votes
0
answers
46
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 ...
0
votes
1
answer
283
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 ...
-1
votes
1
answer
34
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?
0
votes
1
answer
73
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 ...
1
vote
0
answers
66
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 ...
0
votes
2
answers
66
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 ...
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 ...
0
votes
0
answers
62
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 ...
0
votes
2
answers
133
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 ...
0
votes
1
answer
46
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 ...
1
vote
1
answer
884
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 ...
0
votes
0
answers
93
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.
...
1
vote
1
answer
344
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?
...
0
votes
2
answers
205
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 ...
2
votes
2
answers
128
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 ...
0
votes
1
answer
163
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 ...
2
votes
1
answer
307
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 ...
1
vote
1
answer
124
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 ...
0
votes
1
answer
458
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? ...
3
votes
1
answer
216
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 ...
3
votes
1
answer
152
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 ...
1
vote
0
answers
39
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 ...
1
vote
0
answers
134
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$ ...
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 ...
1
vote
0
answers
242
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)$ ...
2
votes
0
answers
922
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 ...
1
vote
1
answer
122
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?
1
vote
0
answers
67
views
How to Optimise Each Multithreading Technique? (Cooperative/Preemptive/Simultaneous)
I am currently in the process of writing an IB Extended Essay on the efficacy of multithreading on increasing the performance of applications. So far, I have been able to deduce that there are three ...
1
vote
3
answers
386
views
Is it 100% OK to say "All software doesn't need to know the system lower than the architecture level"?
Most of you know this diagram. If this diagram is true, all software is free to not know the levels lower than ISA. But it's not true. Softwares like performance-critical programs or system softwares ...
1
vote
2
answers
1k
views
Solving the Path Explosion Problem in Symbolic Execution
Looking at the Symbolic Execution limitations, there are some good solutions to the "Environment interactions" problems. However, the solutions to the path explosion problem are less than ideal.
...