User Mr. Sigma.

7

votes

2

answers

1k

views

Bounded waiting and starvation free in critical section problem

Sep 11 at 0:58 xskxzr 6,539

36

votes

8

answers

9k

views

Are there any non-finite automata?

automata finite-automata

Jul 6 at 22:23 reinierpost 3,970

4

votes

1

answer

3k

views

How to satisfy bounded waiting in case of deadlock?

operating-systems deadlocks

May 5 at 8:47 mb14 1

37

votes

4

answers

8k

views

Worst case $O(n \ln n)$ in place stable sort?

algorithms reference-request sorting in-place

Mar 23 at 13:09 Chromatix 109

48

votes

2

answers

34k

views

Is a push-down automaton with two stacks equivalent to a turing machine?

computability turing-machines automata pushdown-automata

Mar 6 at 15:23 Yanior Weg 121

7

votes

2

answers

1k

views

DCFL with prefix property have LR(0) grammar?

formal-languages context-free lr-k

Dec 25 '19 at 9:27 Community♦ 1

8

votes

2

answers

305

views

Is {a^n (a+b)^n | n>0} a Deterministic CFL?

formal-languages automata context-free pushdown-automata

Oct 28 '19 at 17:47 xskxzr 6,539

3

votes

1

answer

3k

views

Difference between Lamport timestamps and Vector clocks

distributed-systems synchronization

Jun 21 '19 at 14:05 Carmine 31

3

votes

2

answers

634

views

How to check for ambiguous grammar if you don't know the string

context-free formal-grammars ambiguity

Apr 14 '19 at 11:16 Yo-yo man 1

92

votes

11

answers

21k

views

Solving or approximating recurrence relations for sequences of numbers

asymptotics proof-techniques combinatorics recurrence-relation reference-question

Mar 22 '19 at 17:44 ryan 4,166

2

votes

1

answer

104

views

Two's complement general formula

binary numeral-representations

Dec 29 '18 at 12:27 dkaeae 4,779

5

votes

2

answers

562

views

Constructive proof to show the quotient of two regular languages is regular

automata regular-languages finite-automata

Dec 25 '18 at 23:19 Hendrik Jan 24.4k

8

votes

2

answers

701

views

Why do DFAs with a single final state have less power?

automata finite-automata computation-models

Dec 7 '18 at 17:24 John L. 24.6k

17

votes

4

answers

10k

views

Why don't we use quick sort on a linked list?

algorithms algorithm-analysis sorting quicksort

Nov 22 '18 at 23:37 Mariusz 1

1

vote

1

answer

77

views

Run-time of Sorting Algorithm

runtime-analysis sorting

Oct 13 '18 at 1:56 Community♦ 1

32

votes

3

answers

4k

views

Will hardware/implementation affect the time/space complexity of algorithms?

algorithms algorithm-analysis data-structures runtime-analysis

Jun 22 '18 at 17:19 nalzok 1,051

39

votes

3

answers

6k

views

What exactly is a logic?

logic mathematical-foundations

Mar 31 '18 at 9:23 Boris 483

7

votes

2

answers

1k

views

Is the intersection of infinitely many recursive sets recursive?

computability sets

Feb 14 '18 at 3:15 Community♦ 1

2

votes

1

answer

282

views

Can quick sort time complexity be $\Theta(n\sqrt n)$ for some inputs?

time-complexity quicksort

Feb 7 '18 at 13:53 gnasher729 21.2k

1

vote

2

answers

677

views

Number of ways to make $n$ cents

recurrence-relation

Feb 7 '18 at 13:20 Yuval Filmus 241k

4

votes

1

answer

2k

views

Number of conflict serializable schedules

concurrency database-theory

Jan 21 '18 at 14:49 Community♦ 1

11

votes

1

answer

5k

views

What is the difference between RAM and TM?

turing-machines computation-models

Jan 7 '18 at 22:51 Rodrigo de Azevedo 814

1

vote

1

answer

1k

views

How to calculate the complexity of a TM?

complexity-theory turing-machines

Jan 3 '18 at 8:53 quicksort 4,042

6

votes

2

answers

10k

views

Relationship between Independent Set and Vertex Cover

graphs np-complete

Dec 29 '17 at 7:02 Jyotirmoy Pramanik 167

3

votes

3

answers

12k

views

Sliding window protocol, calculation of sequence number bits

computer-networks

Dec 16 '17 at 14:26 Community♦ 1

5

votes

4

answers

2k

views

Is there really a $ O(1/n) $ algorithm?

algorithms algorithm-analysis runtime-analysis

Dec 1 '17 at 6:51 clemens 362

1

vote

1

answer

2k

views

T(n/3) + log(n)

asymptotics recurrence-relation

Nov 29 '17 at 17:10 Nicola Mela 1

15

votes

3

answers

4k

views

Are there any countable sets that are not computably enumerable?

computability semi-decidability

Sep 23 '17 at 21:33 kasperd 203

15

votes

1

answer

540

views

Mathematics topics or fields that increase computer programming proficiency? [closed]

mathematical-foundations

Aug 30 '17 at 2:51 jmite 28k

44

votes

2

answers

17k

views

How to show that a function is not computable?

computability proof-techniques undecidability reference-question

Nov 14 '15 at 19:28 Community♦ 1

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

33 Bookmarks

Bounded waiting and starvation free in critical section problem

Are there any non-finite automata?

How to satisfy bounded waiting in case of deadlock?

Worst case $O(n \ln n)$ in place stable sort?

Is a push-down automaton with two stacks equivalent to a turing machine?

DCFL with prefix property have LR(0) grammar?

Is {a^n (a+b)^n | n>0} a Deterministic CFL?

Difference between Lamport timestamps and Vector clocks

How to check for ambiguous grammar if you don't know the string

Solving or approximating recurrence relations for sequences of numbers

Two's complement general formula

Constructive proof to show the quotient of two regular languages is regular

Why do DFAs with a single final state have less power?

Why don't we use quick sort on a linked list?

Run-time of Sorting Algorithm

Will hardware/implementation affect the time/space complexity of algorithms?

What exactly is a logic?

Is the intersection of infinitely many recursive sets recursive?

Can quick sort time complexity be $\Theta(n\sqrt n)$ for some inputs?

Number of ways to make $n$ cents

Number of conflict serializable schedules

What is the difference between RAM and TM?

How to calculate the complexity of a TM?

Relationship between Independent Set and Vertex Cover

Sliding window protocol, calculation of sequence number bits

Is there really a $ O(1/n) $ algorithm?

T(n/3) + log(n)

Are there any countable sets that are not computably enumerable?

Mathematics topics or fields that increase computer programming proficiency? [closed]

How to show that a function is not computable?