Question

Direct Reduction, Turing machine and a DFA

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

838

Views

Direct Reduction, Turing machine and a DFA

Published on 03 January 2025 at 01:37

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

344

Views

Is equality decidable on any coinductive type?

Published on 27 December 2024 at 19:10

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

736

Views

Generating run time proofs with type predicates in Idris

Published on 07 January 2025 at 10:48

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

400

Views

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

Published on 30 December 2024 at 21:33

score 1k · Answer 5 · 2025-01-03 01:42:45

1k

Views

Is this language decidable, recognizable, or unrecognizable?

Published on 03 January 2025 at 01:42

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

222

Views

Does the order of prenex quantification matter in EPR fragment?

Published on 01 January 2025 at 12:50

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

138

Views

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

Published on 07 January 2025 at 12:12

score 3.3k · Answer 8 · 2025-01-03 01:33:58

3.3k

Views

Is this language decidable?

Published on 03 January 2025 at 01:33

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

563

Views

Recursively enumerable (computably enumerable) languages closed under permutation?

Published on 05 December 2024 at 04:10

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

660

Views

reduction from ALLtm to Etm

Published on 05 December 2024 at 16:12

score 474 · Answer 11 · 2024-12-24 13:48:56

474

Views

Is a given TM having finite states is decidable or not?

Published on 24 December 2024 at 13:48

score 536 · Answer 12 · 2024-12-05 16:22:00

536

Views

Determining whether the following language is decidable

Published on 05 December 2024 at 16:22

score 59 · Answer 13 · 2024-12-05 16:15:36

59

Views

Wonder is the following language finite

Published on 05 December 2024 at 16:15

score 703 · Answer 14 · 2025-01-03 10:32:16

703

Views

How to prove that the following language is not decidable?

Published on 03 January 2025 at 10:32

score 232 · Answer 15 · 2024-12-29 04:11:05

232

Views

Are linear problems on rational numbers decidable in Z3?

Published on 29 December 2024 at 04:11

score 700 · Answer 16 · 2024-12-05 04:31:50

700

Views

"Reduction" from the complement of the universal language (L_u) to the language of nonempty-language Turing machines (L_ne)

Published on 05 December 2024 at 04:31

score 141 · Answer 17 · 2024-12-27 11:36:13

141

Views

Applying Reflexivity of String Equivalence in Agda Proofs

Published on 27 December 2024 at 11:36

score 567 · Answer 18 · 2024-12-20 19:46:34

567

Views

Show that the language is decidable

Published on 20 December 2024 at 19:46

score 87 · Answer 19 · 2024-12-05 16:23:10

87

Views

Can we decide if a number n belongs to a countable set S?

Published on 05 December 2024 at 16:23

score 628 · Answer 20 · 2024-12-25 04:09:23

628

Views

Check whether 2 languages are Turing recognizable or co-Turing recognizable

Published on 25 December 2024 at 04:09

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

Is a given TM having finite states is decidable or not?

Determining whether the following language is decidable

Wonder is the following language finite

How to prove that the following language is not decidable?

Are linear problems on rational numbers decidable in Z3?

"Reduction" from the complement of the universal language (L_u) to the language of nonempty-language Turing machines (L_ne)

Applying Reflexivity of String Equivalence in Agda Proofs

Show that the language is decidable

Can we decide if a number n belongs to a countable set S?

Check whether 2 languages are Turing recognizable or co-Turing recognizable

Trending Questions

Popular # Hahtags

Popular Questions