User k.stm

210

votes

31

answers

50k

views

Why is writing down mathematical proofs more fault-proof than writing computer code?

Mar 30 at 17:07 gnasher729 22.7k

179

votes

3

answers

22k

views

Is there a system behind the magic of algorithm analysis?

algorithms algorithm-analysis runtime-analysis proof-techniques reference-question

Apr 10 '15 at 21:10 Community♦ 1

128

votes

7

answers

34k

views

Is Category Theory useful for learning functional programming?

programming-languages functional-programming category-theory

Dec 7 '19 at 1:24 winitzki 133

119

votes

15

answers

14k

views

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

algorithms algorithm-analysis education correctness-proof didactics

May 16 at 15:59 laszlzso 129

94

votes

5

answers

83k

views

How to prove that a language is not context-free?

formal-languages context-free proof-techniques reference-question

May 15 '17 at 21:59 Community♦ 1

83

votes

6

answers

14k

views

Is there any concrete relation between Gödel's incompleteness theorem, the halting problem and universal Turing machines?

computability logic halting-problem incompleteness

Mar 27 '20 at 21:06 Julius Kunze 131

80

votes

8

answers

57k

views

Graph searching: Breadth-first vs. depth-first

algorithms graphs search-algorithms graph-traversal

Aug 2 '16 at 18:41 Community♦ 1

72

votes

6

answers

24k

views

Formal program verification in practice

programming-languages program-correctness software-verification

Oct 12 '19 at 19:19 ticktock 111

70

votes

1

answer

13k

views

Language theoretic comparison of LL and LR grammars

formal-languages formal-grammars parsers reference-question

Apr 23 '17 at 21:46 Community♦ 1

69

votes

4

answers

16k

views

What is the novelty in MapReduce?

algorithms distributed-systems parallel-computing algorithm-design

Sep 8 '15 at 15:41 Alejandro Montenegro 1

55

votes

7

answers

30k

views

Why does a processor have 32 registers?

computer-architecture

Feb 29 '20 at 23:01 vonbrand 13.1k

52

votes

5

answers

9k

views

Why are so many internet protocols text-based?

computer-networks communication-protocols protocols

Mar 18 at 11:38 user3840170 105

40

votes

7

answers

3k

views

Explaining the relevance of asymptotic complexity of algorithms to practice of designing algorithms

algorithms complexity-theory education

Jan 5 '16 at 11:44 Kaveh 21.3k

38

votes

6

answers

6k

views

What use are groups, monoids, and rings in database computations?

reference-request discrete-mathematics database-theory applied-theory group-theory

Feb 28 '16 at 16:32 Community♦ 1

38

votes

5

answers

6k

views

Is there a known maximum for how much a string of 0's and 1's can be compressed?

data-compression

Nov 30 '15 at 14:49 Community♦ 1

30

votes

8

answers

8k

views

Is it a problem to be a programmer with no knowledge about computational complexity?

algorithms algorithm-analysis education applied-theory

May 20 '15 at 14:29 Community♦ 1

23

votes

1

answer

7k

views

How to show that L = L(G)?

formal-languages formal-grammars proof-techniques reference-question

Jun 13 '15 at 8:34 Community♦ 1

21

votes

2

answers

5k

views

How to describe algorithms, prove and analyse them?

algorithms proof-techniques runtime-analysis

May 2 '16 at 18:43 Community♦ 1

14

votes

2

answers

648

views

Reference request: Category theory as it applies to type systems

reference-request programming-languages type-theory category-theory

Sep 28 '16 at 12:48 Martin Berger 7,968

13

votes

2

answers

1k

views

Lambda calculus: difference between contexts and evaluation contexts

programming-languages lambda-calculus

Mar 20 '14 at 14:41

12

votes

3

answers

14k

views

The importance of normal forms like Chomsky normal form for CFGs

formal-languages context-free formal-grammars normal-forms

Nov 20 '17 at 19:24 alhelal 105

7

votes

1

answer

809

views

It is possible to implement a greater than function using only addition, substractions and multiplications?

algorithms linear-algebra

Mar 19 '16 at 13:48 user2991856 427

5

votes

5

answers

572

views

Can we use domains other than the naturals in computability theory?

computability computation-models

May 29 '14 at 15:39 Thomas Klimpel 5,236

1

vote

3

answers

1k

views

Why every finite set is computable?

computability turing-machines

Jul 12 '13 at 5:55 Community♦ 1

1

vote

1

answer

246

views

Pros and cons of representing strings as lists of characters

programming-languages compilers functional-programming

Oct 17 '13 at 11:58 Community♦ 1

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

25 Bookmarks

Why is writing down mathematical proofs more fault-proof than writing computer code?

Is there a system behind the magic of algorithm analysis?

Is Category Theory useful for learning functional programming?

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

How to prove that a language is not context-free?

Is there any concrete relation between Gödel's incompleteness theorem, the halting problem and universal Turing machines?

Graph searching: Breadth-first vs. depth-first

Formal program verification in practice

Language theoretic comparison of LL and LR grammars

What is the novelty in MapReduce?

Why does a processor have 32 registers?

Why are so many internet protocols text-based?

Explaining the relevance of asymptotic complexity of algorithms to practice of designing algorithms

What use are groups, monoids, and rings in database computations?

Is there a known maximum for how much a string of 0's and 1's can be compressed?

Is it a problem to be a programmer with no knowledge about computational complexity?

How to show that L = L(G)?

How to describe algorithms, prove and analyse them?

Reference request: Category theory as it applies to type systems

Lambda calculus: difference between contexts and evaluation contexts

The importance of normal forms like Chomsky normal form for CFGs

It is possible to implement a greater than function using only addition, substractions and multiplications?

Can we use domains other than the naturals in computability theory?

Why every finite set is computable?

Pros and cons of representing strings as lists of characters