User babou

63 votes

Accepted

What properties of a programming language make compilation impossible?

answered Sep 2, 2014 at 11:53

29 votes

Accepted

Why are functional languages Turing complete?

answered Jul 10, 2015 at 16:19

28 votes

Accepted

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

answered Mar 11, 2014 at 16:08

26 votes

Accepted

What determines the "speed" of a programming language?

answered Mar 14, 2015 at 11:22

23 votes

Difference between normal-order and applicative-order evaluation

answered Mar 26, 2015 at 14:25

23 votes

Accepted

Is Morse Code binary, ternary or quinary?

answered Feb 28, 2015 at 22:19

19 votes

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

answered Feb 17, 2014 at 10:20

16 votes

Accepted

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

answered Jul 26, 2015 at 22:50

16 votes

Accepted

Kleene star operation on the empty language

answered Jul 31, 2015 at 16:07

15 votes

Accepted

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

answered Feb 15, 2014 at 23:31

15 votes

Accepted

Turing machine - infinite tape in one or two directions

answered Mar 20, 2014 at 18:53

15 votes

Accepted

What does "non-pathological data" mean?

answered Jun 14, 2014 at 11:57

15 votes

Accepted

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

answered Oct 26, 2014 at 15:48

14 votes

Accepted

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

answered May 29, 2015 at 12:20

13 votes

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

answered May 21, 2015 at 13:20

13 votes

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

answered Dec 15, 2014 at 1:45

12 votes

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

answered Aug 23, 2015 at 12:07

12 votes

Why Term Rewriting?

answered Dec 29, 2014 at 0:08

11 votes

Accepted

how to draw a complement of a Turing Machine?

answered Apr 3, 2014 at 0:38

11 votes

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

answered Mar 4, 2014 at 1:21

11 votes

Accepted

How do garbage collectors avoid stack overflow?

answered Apr 21, 2015 at 0:11

10 votes

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

answered Jul 16, 2015 at 22:48

10 votes

Accepted

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

answered Mar 31, 2014 at 5:53

10 votes

Accepted

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

answered Mar 30, 2014 at 12:54

10 votes

Why is the halting problem decidable for LBA?

answered Mar 22, 2014 at 9:07

10 votes

Accepted

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

answered Jun 24, 2014 at 21:39

10 votes

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

answered Nov 10, 2014 at 11:10

10 votes

Accepted

Are DCFLs closed under reversal?

answered Oct 7, 2014 at 13:22

10 votes

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

answered Oct 6, 2014 at 16:08

9 votes

Accepted

Is CYK still relevant today?

answered Oct 26, 2014 at 9:45

Stack Exchange Network

415 Answers

What properties of a programming language make compilation impossible?

Why are functional languages Turing complete?

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

What determines the "speed" of a programming language?

Difference between normal-order and applicative-order evaluation

Is Morse Code binary, ternary or quinary?

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

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

Kleene star operation on the empty language

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

Turing machine - infinite tape in one or two directions

What does "non-pathological data" mean?

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

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

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

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

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

Why Term Rewriting?

how to draw a complement of a Turing Machine?

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

How do garbage collectors avoid stack overflow?

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

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

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

Why is the halting problem decidable for LBA?

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

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

Are DCFLs closed under reversal?

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

Is CYK still relevant today?