This account is temporarily suspended network-wide. The suspension period ends on Apr 8 '28 at 14:45.

### Questions (12)

 10 Is the halting problem decidable for 3 symbol one dimensional cellular automata? 5 What does the set {n | n is an integer and n = n + 1} represent? 3 How many times can you pour milk among 3 buckets? 2 How to prove that $n$ sets have maximum of $2^n-1$ disjoint subsets when you have operations $\cup , \cap , \setminus$? 2 When proving NP-completeness do I only need one instance of a problem or all of them?

### Reputation (1)

This user has no recent positive reputation changes

 1 Finding nfa or dfa for a language 1 Is the halting problem decidable for 3 symbol one dimensional cellular automata? 1 Counting the number of tree when the set of the subtrees is given 0 How to prove that $n$ sets have maximum of $2^n-1$ disjoint subsets when you have operations $\cup , \cap , \setminus$? 0 Are there any theorems/formulas that apply to the height of comparison trees?

### Tags (27)

 1 computability × 4 1 finite-automata × 2 1 algorithms × 4 1 trees 1 halting-problem × 3 1 counting 1 cellular-automata × 2 1 automata 1 decision-problem × 2 0 formal-languages × 4