Question

Why is it so hard to translate some proves into machine-readable form?

score 467 · Answer 1 · 2016-03-13 17:38:23

467

Views

Why is it so hard to translate some proves into machine-readable form?

Published on 13 Mar 2016 - 17:38

score 1.4k · Answer 2 · 2016-03-15 02:37:58

1.4k

Views

Drawing a state diagram for a Turing Machine

Published on 15 Mar 2016 - 2:37

score 1.9k · Answer 3 · 2016-03-17 11:06:34

1.9k

Views

non deterministic turing machine for concatenation

Published on 17 Mar 2016 - 11:06

score 1.1k · Answer 4 · 2016-03-24 08:20:54

1.1k

Views

Prove claims about disjoint union and decidable/undecidable languages

Published on 24 Mar 2016 - 8:20

score 376 · Answer 5 · 2016-03-28 21:22:12

376

Views

Automatic proof verification by a Turing machine

Published on 28 Mar 2016 - 21:22

score 303 · Answer 6 · 2016-04-06 12:23:52

303

Views

turing machine decidability language

Published on 06 Apr 2016 - 12:23

score 54 · Answer 7 · 2016-04-06 19:45:36

54

Views

turing machine decidable description for the language

Published on 06 Apr 2016 - 19:45

score 25 · Answer 8 · 2016-04-07 07:45:35

25

Views

Is each string decideble?

Published on 07 Apr 2016 - 7:45

score 72 · Answer 9 · 2016-04-07 15:20:27

72

Views

proof that languages are/are not in RE (probably with mapping reduce)

Published on 07 Apr 2016 - 15:20

score 1.3k · Answer 10 · 2016-04-12 08:42:53

1.3k

Views

Is the union of undecidable languages not Turing-recognizable?

Published on 12 Apr 2016 - 8:42

score 52 · Answer 11 · 2016-04-15 12:59:49

52

Views

Prove that a certain intrinsic property of Turing machines is not decidable

Published on 15 Apr 2016 - 12:59

score 28 · Answer 12 · 2016-04-16 18:52:37

28

Views

simple questions on $TM$s runs lengths

Published on 16 Apr 2016 - 18:52

score 1k · Answer 13 · 2016-04-25 16:29:48

1k

Views

Construct a turing machine that accepts L = {ww : w belongs to {a,b}*}

Published on 25 Apr 2016 - 16:29

score 827 · Answer 14 · 2016-04-26 20:25:16

827

Views

Using reductions of turing machines properly

Published on 26 Apr 2016 - 20:25

score 305 · Answer 15 · 2016-04-28 12:19:50

305

Views

Is the problem decidable with Turing machine M that inputs x,y,z does M halts on these 3 instances

Published on 28 Apr 2016 - 12:19

List Question

Why is it so hard to translate some proves into machine-readable form?

Drawing a state diagram for a Turing Machine

non deterministic turing machine for concatenation

Prove claims about disjoint union and decidable/undecidable languages

Automatic proof verification by a Turing machine

turing machine decidability language

turing machine decidable description for the language

Is each string decideble?

proof that languages are/are not in RE (probably with mapping reduce)

Is the union of undecidable languages not Turing-recognizable?

Prove that a certain intrinsic property of Turing machines is not decidable

simple questions on $TM$s runs lengths

Construct a turing machine that accepts L = {ww : w belongs to {a,b}*}

Using reductions of turing machines properly

Is the problem decidable with Turing machine M that inputs x,y,z does M halts on these 3 instances

Trending Questions

Popular # Hahtags

Popular Questions