Skip to main content
babou's user avatar
babou's user avatar
babou's user avatar
babou
  • Member for 11 years, 1 month
  • Last seen this week
63 votes
Accepted

What properties of a programming language make compilation impossible?

29 votes
Accepted

Why are functional languages Turing complete?

28 votes
Accepted

Why is it important for functions to be anonymous in lambda calculus?

27 votes
Accepted

What determines the "speed" of a programming language?

23 votes

Difference between normal-order and applicative-order evaluation

23 votes
Accepted

Is Morse Code binary, ternary or quinary?

19 votes

Why and how is a quantum computer faster than a regular computer?

17 votes
Accepted

Books to prepare before reading Knuth's The Art Of Computer Programming (TAOCP)

16 votes
Accepted

Turing machine - infinite tape in one or two directions

16 votes
Accepted

Could the Halting Problem be "resolved" by escaping to a higher-level description of computation?

16 votes
Accepted

Kleene star operation on the empty language

15 votes
Accepted

What does "non-pathological data" mean?

15 votes
Accepted

Is there an algorithm that provably exists although we don't know what it is?

14 votes
Accepted

Removing left-recursion in grammar while maintaining left-association of operator

13 votes

Is there a more intuitive proof of the halting problem's undecidability than diagonalization?

13 votes

Single-tape Turing Machines with write-protected input recognize only Regular Languages

12 votes

Why Term Rewriting?

12 votes

How can a language whose compiler is written in C ever be faster than C?

11 votes
Accepted

How do garbage collectors avoid stack overflow?

11 votes
Accepted

how to draw a complement of a Turing Machine?

11 votes

Has Anyone Actually Created a System that Writes Computer Programs from specification?

10 votes
Accepted

Difference between diameter of a graph vs longest path of the graph

10 votes
Accepted

What is pass-by-value-result and its advantage and disadvantage?

10 votes

Why is the halting problem decidable for LBA?

10 votes
Accepted

How do I reconstruct the forest of syntax trees from the Earley vector?

10 votes

Human computing power: Can humans decide the halting problem on Turing Machines?

10 votes

What is the Relationship Between Programming Languages, Regular Expressions and Formal Languages

10 votes
Accepted

Are DCFLs closed under reversal?

10 votes

Constructive proof of decidability of finite Halting-problem-style set that does not use table lookup

9 votes
Accepted

Is CYK still relevant today?

1
2 3 4 5
14