Computer Science Stack Exchange

0 votes

2 answers

49 views

Why can one define a Turing Machine by its "description"?

KatsuragiCSL

103

modified 4 hours ago

0 votes

1 answer

42 views

How big is a formula equivalent to a wff over $n$ variables with $2^n$ subformulas?

CommunityBot

1

modified 5 hours ago

1 vote

1 answer

45 views

How to show that $M$ is not finitely axiomatizable in the following case?

Noah Schweber

2,950

modified 5 hours ago

1 vote

1 answer

882 views

What fraction of all combinations is guaranteed to be deadlock free?

CommunityBot

1

modified 7 hours ago

0 votes

1 answer

271 views

Prove: If $T'$ is not a MST one of its edges may be replaced by a lighter edge in order to get a lighter spanning tree

CommunityBot

1

modified 8 hours ago

0 votes

0 answers

10 views

why i am able to access private member of inner class with object of main public class,i am new can somebody please tell me

munish

1

asked 9 hours ago

2 votes

0 answers

11 views

Vertex cover approximation: what's wrong with max-degree heuristic?

Kye W Shi

121

asked 10 hours ago

0 votes

1 answer

117 views

Bankers Algorithm - maximum number of processes

CommunityBot

1

modified 10 hours ago

0 votes

1 answer

107 views

Intersection of Infinite Regular Language with CFL

CommunityBot

1

modified 11 hours ago

5 votes

2 answers

155 views

Accelerating semidecision of halting problem

ruakh

678

modified 12 hours ago

-1 votes

0 answers

7 views

Sliding Window Subarray Question - TLE

Rithik Gundeti

1

asked 13 hours ago

0 votes

1 answer

40 views

Naive Read-Write Lock

CommunityBot

1

modified 13 hours ago

1 vote

2 answers

182 views

How to correctly describe this action, deleting an edge that "shortcut" some vertices

Michael M

1

answered 13 hours ago

2 votes

2 answers

165 views

Tigers and elephants can't drink water from a pond simultaneously, while more than one tiger or more than one elephants can drink water simultaneously

CommunityBot

1

modified 14 hours ago

Stack Exchange Network

Explore our questions

Why can one define a Turing Machine by its "description"?

How big is a formula equivalent to a wff over $n$ variables with $2^n$ subformulas?

How to show that $M$ is not finitely axiomatizable in the following case?

What fraction of all combinations is guaranteed to be deadlock free?

Prove: If $T'$ is not a MST one of its edges may be replaced by a lighter edge in order to get a lighter spanning tree

why i am able to access private member of inner class with object of main public class,i am new can somebody please tell me

Vertex cover approximation: what's wrong with max-degree heuristic?

Bankers Algorithm - maximum number of processes

Intersection of Infinite Regular Language with CFL

Accelerating semidecision of halting problem

Sliding Window Subarray Question - TLE

Naive Read-Write Lock

How to correctly describe this action, deleting an edge that "shortcut" some vertices

Tigers and elephants can't drink water from a pond simultaneously, while more than one tiger or more than one elephants can drink water simultaneously

Hot Network Questions