TechQA.

Question

Direct Reduction, Turing machine and a DFA

score 828 · Answer 1 · 2025-01-03 01:37:56

1

Answer

828

Views

Direct Reduction, Turing machine and a DFA

828 views Asked by David At 03 January 2025 at 01:37

score 323 · Answer 2 · 2024-12-27 19:10:17

Is equality decidable on any coinductive type?

323 views Asked by Mitchell Buckley At 27 December 2024 at 19:10

score 729 · Answer 3 · 2025-01-07 10:48:03

Generating run time proofs with type predicates in Idris

729 views Asked by Vic Smith At 07 January 2025 at 10:48

score 391 · Answer 4 · 2024-12-30 21:33:51

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

391 views Asked by Michael Anthony Leber At 30 December 2024 at 21:33

score 1051 · Answer 5 · 2025-01-03 01:42:45

Is this language decidable, recognizable, or unrecognizable?

1k views Asked by 3932695 At 03 January 2025 at 01:42

score 204 · Answer 6 · 2025-01-01 12:50:54

Does the order of prenex quantification matter in EPR fragment?

204 views Asked by Gowtham Kaki At 01 January 2025 at 12:50

score 124 · Answer 7 · 2025-01-07 12:12:29

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

124 views Asked by AudioBubble At 07 January 2025 at 12:12

score 3353 · Answer 8 · 2025-01-03 01:33:58

Is this language decidable?

3.3k views Asked by user1171851 At 03 January 2025 at 01:33

score 549 · Answer 9 · 2024-12-05 04:10:20

Recursively enumerable (computably enumerable) languages closed under permutation?

549 views Asked by user3688391 At 05 December 2024 at 04:10

score 650 · Answer 10 · 2024-12-05 16:12:48

reduction from ALLtm to Etm

650 views Asked by Dan At 05 December 2024 at 16:12

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