TechQA.

Question

Direct Reduction, Turing machine and a DFA

score 794 · Answer 1 · 2024-09-13 05:47:19

794 views Asked by David At 13 September 2024 at 05:47

score 287 · Answer 2 · 2024-09-19 08:07:58

287 views Asked by Mitchell Buckley At 19 September 2024 at 08:07

score 699 · Answer 3 · 2024-09-11 04:28:15

Generating run time proofs with type predicates in Idris

score 353 · Answer 4 · 2024-09-09 02:42:02

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

score 1014 · Answer 5 · 2024-09-14 14:53:33

Is this language decidable, recognizable, or unrecognizable?

score 168 · Answer 6 · 2024-09-15 06:34:08

Does the order of prenex quantification matter in EPR fragment?

score 98 · Answer 7 · 2024-09-12 13:16:33

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

score 3318 · Answer 8 · 2024-09-12 22:24:13

3.3k views Asked by user1171851 At 12 September 2024 at 22:24

score 521 · Answer 9 · 2024-09-14 22:52:54

Recursively enumerable (computably enumerable) languages closed under permutation?

score 618 · Answer 10 · 2024-09-09 02:30:19

618 views Asked by Dan At 09 September 2024 at 02:30

List Question