Network profile

TheNotMe

Reputation

571

581
483
385

2018
2019
2020
2021

Top tag

algorithms

Next privilege

1,000 Rep.

See votes

Badges

1

5

17

Newest

Popular Question

Next badge

0/1

Impact

0 posts edited

1 helpful flag

37 votes cast

4 Bookmarks

Votes Activity Newest Views Added

17

votes

3

answers

781

views

Is there a TM that halts on all inputs but that property is not provable?

computability reference-request turing-machines halting-problem

May 14 '14 at 21:43 cody 7,463

14

votes

2

answers

7k

views

Is it decidable whether a TM reaches some position on the tape?

computability turing-machines undecidability

Jul 21 '16 at 6:45 user3420029 1

8

votes

1

answer

7k

views

Prove that regular languages are closed under the cycle operator

formal-languages regular-languages finite-automata closure-properties

Jan 20 '14 at 8:35 Raphael♦ 69.3k

3

votes

1

answer

173

views

Find the lightest weight of a path between $u$ to $v$ that contains no more then $k$ edges (If there's one)

algorithms graphs

Aug 28 '12 at 23:11 Raphael♦ 69.3k

Computer Science Stack Exchange works best with JavaScript enabled