User benrg

1 vote

In the simulation of a C-program by a Turing machine, how does a TM determine which instruction to execute?

answered Nov 21 at 21:22

1 vote

(how) is assignment or binding possible in purely functional languages?

answered Oct 30 at 20:30

1 vote

If the virtual address space can be larger than the physical address space, how are the address mappings stored in memory?

answered Oct 30 at 2:15

4 votes

Accepted

What is the reason or motivation for having 128-bit pointers?

answered Oct 25 at 7:35

3 votes

Accepted

Why is handling word sizes smaller than the native size of a processor sometimes slower?

answered Oct 13 at 7:51

0 votes

Use of pointers in linked list

answered Sep 4 at 9:11

5 votes

Accepted

What are the conditions necessary for a programming language to have no undefined behavior?

answered Aug 17 at 22:38

2 votes

Does the first incompleteness theorem imply that any Turing complete programming language must have undefined behavior?

answered Aug 17 at 9:03

2 votes

Clear, intuitive derivation of the fixed-point combinator (Y combinator)?

answered Oct 1, 2021 at 1:01

2 votes

Empty regular expression

answered May 26 at 22:30

3 votes

Why is this not a proof of P # NP

answered Apr 9 at 6:59

1 vote

Why is Rule 110 considered "weakly" universal?

answered Dec 12, 2022 at 21:30

3 votes

Accepted

Problems Solvable in Poly time but not verifiable in Poly time

answered Dec 6, 2022 at 22:54

4 votes

Accepted

Am I right that Reed-Solomon codes can be used to implement arbitrary-parity RAID schemes?

answered Nov 14, 2022 at 22:49

1 vote

Accepted

Why can't we have P=NP but P not contained in NP-hard?

answered Oct 16, 2022 at 0:03

4 votes

Accepted

What is the point of Bloom's filter if its false positive rate is so high?

answered Oct 15, 2022 at 6:51

2 votes

Accepted

How does GHC insert type abstraction/application under the RankNTypes extension

answered Sep 18, 2022 at 2:49

5 votes

Regular languages that seem irregular

answered Aug 23, 2022 at 20:48

1 vote

Accepted

Algorithm to generate points uniformly at random from a ball

answered Aug 2, 2022 at 19:41

3 votes

Accepted

How to prove that P = NP?

answered Jul 22, 2022 at 20:43

4 votes

NFA: How does it function with empty-string moves?

answered Mar 22, 2022 at 18:45

3 votes

What are the technical reasons programs in C and C++ do not show runtime errors, but programs in Rust and Golang do?

answered Feb 21, 2022 at 22:20

5 votes

Accepted

Why we can not define factorial in lambda calculus

answered Feb 17, 2022 at 2:29

4 votes

Why is C still the fastest? Critique my take

answered Feb 14, 2022 at 0:42

2 votes

Accepted

Isn't de-duplication faster, if you stop search as soon as some threshold of duplicates is found, delete duplicates, and restart search?

answered Feb 7, 2022 at 21:09

1 vote

Why Prefer Two Stacks to an Array for Undo/Redo?

answered Jan 22, 2022 at 7:35

2 votes

Accepted

What is wrong with this "proof" of $coNP = NP$?

answered Oct 19, 2021 at 7:03

1 vote

Accepted

Why we need topological ordering for finding shortest paths

answered Sep 20, 2021 at 20:34

1 vote

What is the entropy of an unordered list?

answered Sep 11, 2021 at 3:09

2 votes

Why does the BOM consist of two bytes instead of one for example in encoding utf-16

answered Sep 10, 2021 at 5:01

Stack Exchange Network

59 Answers

In the simulation of a C-program by a Turing machine, how does a TM determine which instruction to execute?

(how) is assignment or binding possible in purely functional languages?

If the virtual address space can be larger than the physical address space, how are the address mappings stored in memory?

What is the reason or motivation for having 128-bit pointers?

Why is handling word sizes smaller than the native size of a processor sometimes slower?

Use of pointers in linked list

What are the conditions necessary for a programming language to have no undefined behavior?

Does the first incompleteness theorem imply that any Turing complete programming language must have undefined behavior?

Clear, intuitive derivation of the fixed-point combinator (Y combinator)?

Empty regular expression

Why is this not a proof of P # NP

Why is Rule 110 considered "weakly" universal?

Problems Solvable in Poly time but not verifiable in Poly time

Am I right that Reed-Solomon codes can be used to implement arbitrary-parity RAID schemes?

Why can't we have P=NP but P not contained in NP-hard?

What is the point of Bloom's filter if its false positive rate is so high?

How does GHC insert type abstraction/application under the RankNTypes extension

Regular languages that seem irregular

Algorithm to generate points uniformly at random from a ball

How to prove that P = NP?

NFA: How does it function with empty-string moves?

What are the technical reasons programs in C and C++ do not show runtime errors, but programs in Rust and Golang do?

Why we can not define factorial in lambda calculus

Why is C still the fastest? Critique my take

Isn't de-duplication faster, if you stop search as soon as some threshold of duplicates is found, delete duplicates, and restart search?

Why Prefer Two Stacks to an Array for Undo/Redo?

What is wrong with this "proof" of $coNP = NP$?

Why we need topological ordering for finding shortest paths

What is the entropy of an unordered list?

Why does the BOM consist of two bytes instead of one for example in encoding utf-16