Computer Science
benrg's user avatar
benrg's user avatar
benrg's user avatar
benrg
  • Member for 4 years, 3 months
  • Last seen this week
Profile Activity

59 Answers

Score Activity Newest
13 votes

Theory behind regex implementations

7 votes

Can a total programming language be Turing-complete?

7 votes
Accepted

Curry-Howard, void, and type checking in Haskell

5 votes
Accepted

Why we can not define factorial in lambda calculus

5 votes

Regular languages that seem irregular

5 votes
Accepted

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

4 votes
Accepted

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

4 votes

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

4 votes
Accepted

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

4 votes
Accepted

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

4 votes
Accepted

Loop optimization of non-tail recursion

4 votes

How do we determine whether a heuristic is better than another in A* search Algorithm?

4 votes

How is `y λx.x y` parsed using the standard pure untyped lambda calculus conventions?

4 votes
Accepted

Why are complex numbers needed to define qubits?

4 votes

Why is C still the fastest? Critique my take

3 votes
Accepted

Why XML dumps from Wikipedia are so compressed?

3 votes

How can a Turing machine compare two strings without modifying them?

3 votes

How to find the compression method used on an unknown sequence of bytes?

3 votes
Accepted

How does asynchronous operations save time in I/O

3 votes
Accepted

How can a machine with fixed output for all inputs be considered a Turing machine?

3 votes

Is it possible to wear-level a FAT32 file system?

3 votes
Accepted

Information-theoretic lower bound for succinct string dictionary of the Unicode Name property

3 votes
Accepted

Problems Solvable in Poly time but not verifiable in Poly time

3 votes

Why is this not a proof of P # NP

3 votes
Accepted

How to prove that P = NP?

3 votes

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

3 votes
Accepted

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

2 votes
Accepted

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

2 votes

Empty regular expression

2 votes

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

1
2

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.