TechQA.

Question

Direct Reduction, Turing machine and a DFA

score 797 · Answer 1 · 2015-06-15 11:06:45

1

Answer

797

Views

Direct Reduction, Turing machine and a DFA

797 views Asked by David At 15 June 2015 at 11:06

score 293 · Answer 2 · 2015-06-18 08:10:55

Is equality decidable on any coinductive type?

293 views Asked by Mitchell Buckley At 18 June 2015 at 08:10

score 703 · Answer 3 · 2014-11-23 23:12:46

Generating run time proofs with type predicates in Idris

703 views Asked by Vic Smith At 23 November 2014 at 23:12

score 358 · Answer 4 · 2013-12-03 03:53:04

How to prove that "Total" is not recursive (decidable)

358 views Asked by Michael Anthony Leber At 03 December 2013 at 03:53

score 1017 · Answer 5 · 2013-12-09 09:03:45

Is this language decidable, recognizable, or unrecognizable?

1k views Asked by 3932695 At 09 December 2013 at 09:03

score 173 · Answer 6 · 2017-09-12 23:38:13

Does the order of prenex quantification matter in EPR fragment?

173 views Asked by Gowtham Kaki At 12 September 2017 at 23:38

score 95 · Answer 7 · 2020-10-14 23:36:26

How to define a subformula of an inductively defined type in Agda?

95 views Asked by AudioBubble At 14 October 2020 at 23:36

score 3329 · Answer 8 · 2012-01-26 17:46:49

Is this language decidable?

3.3k views Asked by user1171851 At 26 January 2012 at 17:46

score 520 · Answer 9 · 2014-12-14 20:17:44

Recursively enumerable (computably enumerable) languages closed under permutation?

520 views Asked by user3688391 At 14 December 2014 at 20:17

score 626 · Answer 10 · 2020-11-21 18:34:44

reduction from ALLtm to Etm

626 views Asked by Dan At 21 November 2020 at 18:34

TechQA.

List Question

Direct Reduction, Turing machine and a DFA

Is equality decidable on any coinductive type?

Generating run time proofs with type predicates in Idris

How to prove that "Total" is not recursive (decidable)

Is this language decidable, recognizable, or unrecognizable?

Does the order of prenex quantification matter in EPR fragment?

How to define a subformula of an inductively defined type in Agda?

Is this language decidable?

Recursively enumerable (computably enumerable) languages closed under permutation?

reduction from ALLtm to Etm

Popular Questions

Popular Tags

Trending Questions