user253751's user avatar
user253751's user avatar
user253751's user avatar
user253751
  • Member for 9 years
  • Last seen this week
1 vote
Accepted

How exactly does stale data appear in temporal buffer in Downfall attack?

1 vote
Accepted

Function of data pin(s) in a single RAM chip

1 vote

Can you enumerate the set of all words over a finite alphabet?

3 votes

How does a CPU jump to a instruction thats no longer in ram?

2 votes
Accepted

I Don't Understand Nothing About Operating Systems even After reading books

1 vote
Accepted

SAT with every variable occuring exactly once

1 vote

Can we solve a decision problem with two identical answers like $false\equiv(\lambda f.\lambda y.y)$ or $0\equiv(\lambda f.\lambda n.n)$?

5 votes

Prove HAKMEM Item 23: connection between arithmetic operations and bitwise operations on integers

1 vote

What does it mean for a shell to parse its command line and to identify the PATH?

0 votes

Is this how endianess work relative to memory?

1 vote

Halting problem disproof

2 votes

To where is the mouse sending signals of a computer?

1 vote

What is the most critical component of a processor?

2 votes
Accepted

If a process needs more RAM, does the Page size simply get bigger or does it get a new page?

4 votes
Accepted

Why is C still the fastest? Critique my take

1 vote

What happens in harvard architecture pipelining if cpu needs to write data and fetch data at the same time?

4 votes
Accepted

How are processor instructions stored in RAM?

3 votes

What is a procedure?

0 votes

Halting problem logic must be wrong

2 votes
Accepted

does finite automata have memory?

0 votes

Proof for Language: L1 ∪ L2 ⊆ L1L2

37 votes
Accepted

What is a CPU clock physically?

2 votes

The opcode "load the next word into Register A" mentioned by Gandalf61

1 vote

Max RAM capacity on modern cpus

4 votes

Why are computers so fundamentally insecure?

2 votes

Halting problem. Decider “recognising itself” in the input? Part 2

4 votes
Accepted

Can a nondeterministic Turing machine improve upon a P-time problem?

3 votes

Halting problem. Decider “recognising itself” in the input?

1 vote

Is it reasonable to assume modern computers can do hardware math with integers up to 2^64?

2 votes

Why is M^e mod N the ciphertext and not just M^e