TechQA.

Question

Direct Reduction, Turing machine and a DFA

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

1

Answer

778

Views

Direct Reduction, Turing machine and a DFA

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

score 275 · Answer 2 · 2024-11-24 22:35:11

Is equality decidable on any coinductive type?

275 views Asked by Mitchell Buckley At 24 November 2024 at 22:35

score 688 · Answer 3 · 2024-11-25 01:18:43

Generating run time proofs with type predicates in Idris

688 views Asked by Vic Smith At 25 November 2024 at 01:18

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

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

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

score 1005 · 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 158 · Answer 6 · 2017-09-12 23:38:13

Does the order of prenex quantification matter in EPR fragment?

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

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

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

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

score 3309 · 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 507 · Answer 9 · 2014-12-14 20:17:44

Recursively enumerable (computably enumerable) languages closed under permutation?

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

score 611 · Answer 10 · 2024-11-20 11:19:55

reduction from ALLtm to Etm

611 views Asked by Dan At 20 November 2024 at 11:19

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