Network profile

Lee

Reputation

217

217

2017
2018
2019
2020

Top tag

undecidability

Next privilege

250 Rep.

View close votes

Badges

2

7

Newest

Yearling

Next badge

0/1

Impact

0 posts edited

0 helpful flags

6 votes cast

7 Questions

Votes Activity Newest Views

2

votes

1

answer

142

views

Disprove that a function exists that counts the turing machines that halt on $\epsilon$

turing-machines undecidability computation-models

Jul 12 '15 at 19:34 Community♦ 1

2

votes

1

answer

99

views

prove that a language is context free given a regular language

formal-languages regular-languages context-free closure-properties

May 8 '15 at 13:19 Raphael♦ 68.1k

1

1

vote

1

answer

832

views

Single-source shortest paths as a linear program

graphs linear-programming

Feb 13 '16 at 18:22 David Richerby 77.8k

1

vote

0

answers

142

views

Winnow versus Perceptron - Why adding irrelevant features increases L2(X) but not L∞(X)?

machine-learning online-algorithms perceptron

Nov 30 '15 at 12:38 Lee 217

1

vote

1

answer

63

views

Why is my proof wrong for $L = H_{TM} \cap \overline{A_{TM}} $

turing-machines undecidability

Jun 21 '15 at 16:13 Rick Decker 13.8k

1

vote

2

answers

5k

views

Prove correctness of DFA ending with ab

automata finite-automata induction

Mar 24 '15 at 11:08 Lee 217

0

votes

0

answers

71

views

mapping reduction for every recursive language [duplicate]

computability reductions undecidability closure-properties

Jun 16 '15 at 19:14 Lee 217

Computer Science Stack Exchange works best with JavaScript enabled