User Jake

22 votes

Accepted

Is 0* decidable?

answered Dec 11, 2014 at 22:21

20 votes

Accepted

Halting problem theory vs. practice

answered May 11, 2020 at 21:47

12 votes

Accepted

Why is automated theorem proving impossible?

answered Apr 30, 2015 at 1:39

10 votes

Accepted

Does immutability in functional programming really exist?

answered Jan 24, 2015 at 18:23

7 votes

How to fool the "try some test cases" heuristic: Algorithms that appear correct, but are actually incorrect

answered May 28, 2015 at 6:23

6 votes

Automatic translation between formal languages

answered Apr 28, 2015 at 6:42

6 votes

Accepted

Why is a deterministic Turing machine a special case of a probabilistic Turing machine?

answered Oct 6, 2015 at 5:54

6 votes

Accepted

Decidability of dependent typing on primitive recursive languages

answered Feb 17, 2016 at 23:42

5 votes

Is there a limit to data compression without mentioning Kolmogorov complexity?

answered Nov 24, 2017 at 5:54

5 votes

Accepted

Why do we distinguish between term abstraction and type abstraction in System F?

answered Nov 15, 2015 at 22:29

5 votes

Accepted

Does the normal form theorem imply that every partially computabe function is primitive recursive?

answered Dec 3, 2014 at 7:19

4 votes

How again do certain sorting methods use $o(n \log n)$ time?

answered Dec 12, 2014 at 1:16

4 votes

Termination in infinite-time

answered Dec 23, 2014 at 7:38

4 votes

Doubt regarding Cantor's diagonalization argument

answered Oct 24, 2019 at 7:21

3 votes

Does deterministic imply algorithmic?

answered Dec 23, 2016 at 5:55

3 votes

Accepted

Will the machine ever reach on any other state other than start state?

answered Nov 12, 2017 at 21:51

3 votes

Accepted

What is a rewrite-based system?

answered Jan 16, 2015 at 2:41

3 votes

Accepted

Evaluating Grover's algorithm on 3-SAT

answered Apr 21, 2015 at 16:51

3 votes

Accepted

Recursive language subtracted from recursively enumerable language

answered Apr 28, 2015 at 2:58

3 votes

∅-free regular expressions?

answered Nov 29, 2015 at 6:32

3 votes

In the Curry-Howard isomorphism as applied to Hindley-Milner types, what proposition corresponds to a -> [a]?

answered Oct 27, 2015 at 3:01

2 votes

When inserting into a binary tree, is there a universal agreed upon place to insert then new node to minimize complexity?

answered Dec 16, 2014 at 0:54

2 votes

Defining computable functions on arbitrary sets

answered Feb 28, 2018 at 1:40

2 votes

Accepted

probablistic procedure to permutate array

answered Aug 10, 2015 at 20:49

2 votes

Accepted

Implicit complexity and interpretation of total languages

answered Mar 25, 2016 at 20:34

1 vote

Language that system calls are implemented in

answered Mar 21, 2016 at 7:36

1 vote

Accepted

What if P implies Q is false when both P and Q are false?

answered Mar 10, 2020 at 20:05

1 vote

linear time nash equilibirum aproximations for two player zero sum games

answered Nov 8, 2020 at 19:44

1 vote

Accepted

Unification Algorithm without Occur Check

answered May 23, 2020 at 2:54

1 vote

What does "Every CFL is decidable" exactly mean?

answered May 28, 2020 at 1:04

Stack Exchange Network

35 Answers

Is 0* decidable?

Halting problem theory vs. practice

Why is automated theorem proving impossible?

Does immutability in functional programming really exist?

How to fool the "try some test cases" heuristic: Algorithms that appear correct, but are actually incorrect

Automatic translation between formal languages

Why is a deterministic Turing machine a special case of a probabilistic Turing machine?

Decidability of dependent typing on primitive recursive languages

Is there a limit to data compression without mentioning Kolmogorov complexity?

Why do we distinguish between term abstraction and type abstraction in System F?

Does the normal form theorem imply that every partially computabe function is primitive recursive?

How again do certain sorting methods use $o(n \log n)$ time?

Termination in infinite-time

Doubt regarding Cantor's diagonalization argument

Does deterministic imply algorithmic?

Will the machine ever reach on any other state other than start state?

What is a rewrite-based system?

Evaluating Grover's algorithm on 3-SAT

Recursive language subtracted from recursively enumerable language

∅-free regular expressions?

In the Curry-Howard isomorphism as applied to Hindley-Milner types, what proposition corresponds to a -> [a]?

When inserting into a binary tree, is there a universal agreed upon place to insert then new node to minimize complexity?

Defining computable functions on arbitrary sets

probablistic procedure to permutate array

Implicit complexity and interpretation of total languages

Language that system calls are implemented in

What if P implies Q is false when both P and Q are false?

linear time nash equilibirum aproximations for two player zero sum games

Unification Algorithm without Occur Check

What does "Every CFL is decidable" exactly mean?