Skip to main content
New
Stack Overflow Jobs powered by Indeed: A job site that puts thousands of tech jobs at your fingertips (U.S. only). Search jobs
Omid Yaghoubi's user avatar
Omid Yaghoubi's user avatar
Omid Yaghoubi's user avatar
Omid Yaghoubi
  • Member for 3 years, 11 months
  • Last seen more than 1 year ago
2 votes
1 answer
92 views

Simulating nondeterministic RAM with nondeterminstic turing machine

1 vote
0 answers
49 views

Does description method matter in Rice’s theorem?

0 votes
0 answers
44 views

Lower bound for $a^kb^k$ in one-tape TM

1 vote
0 answers
15 views

Decidablility of complexity properties and its relation to finite description method

1 vote
0 answers
247 views

Confused about the concept of deciding in nondeterministic Turing machines

1 vote
1 answer
162 views

Another version of Geography Game

0 votes
1 answer
48 views

Uncomputability of least member selection

3 votes
0 answers
150 views

Why there is $\log n$ factor in time constructible definition?

2 votes
1 answer
145 views

$\log n$ lower bound for space complexity

1 vote
3 answers
244 views

Spanning tree whose sum of edge weights are between two boundries

1 vote
0 answers
42 views

Prove that characteristic function $f_w$ in write protected input turing machine behave as a 2FSA

0 votes
1 answer
47 views

Is a Turing Machine a Well-formed formula?

0 votes
1 answer
126 views

Finding lowest point in circles

1 vote
1 answer
247 views

Is there a mapping reduction for every two language $A$ and $B$ to some language $C$?

2 votes
1 answer
93 views

Is s-grammar powerful enough to generate all possible DCFL?

2 votes
1 answer
245 views

When our two-state PDA constructed from CFG is non-deterministic PDA?