Question

Is it decidable if a finite set of identities imply the commutative identity?

score 63 · Answer 1 · 2023-08-16 18:38:23

63

Views

Is it decidable if a finite set of identities imply the commutative identity?

Published on 16 Aug 2023 - 18:38

score 63 · Answer 2 · 2023-09-01 09:34:30

63

Views

Decidable formal language with a finite but non-computable size

Published on 01 Sep 2023 - 9:34

score 224 · Answer 3 · 2023-09-04 03:31:52

224

Views

How to understand Tarski’s Real Closed Field theory result

Published on 04 Sep 2023 - 3:31

score 54 · Answer 4 · 2023-09-11 14:55:57

54

Views

Number of bitstrings where any subpattern repeats at most $d$ times

Published on 11 Sep 2023 - 14:55

score 77 · Answer 5 · 2023-10-14 20:37:57

77

Views

What is decidability and completeness?

Published on 14 Oct 2023 - 20:37

score 50 · Answer 6 · 2023-10-24 20:37:24

50

Views

How is $f_1(n)$ not computable but $f_2(n)$ is?

Published on 24 Oct 2023 - 20:37

score 68 · Answer 7 · 2023-10-25 23:33:52

68

Views

Problems with universal encoding format for Turing Machines?

Published on 25 Oct 2023 - 23:33

score 15 · Answer 8 · 2026-02-23 10:16:55

15

Views

Proving undecidability of a problem by showing that a single instance is undecidable

Published on 23 Feb 2026 - 10:16

score 36 · Answer 9 · 2023-11-29 09:49:05

36

Views

Inequality of two real numbers is semi-decidable

Published on 29 Nov 2023 - 9:49

score 91 · Answer 10 · 2023-12-08 16:19:04

91

Views

Help understanding the proof that $L = \{ \langle M \rangle \mid M \text{ is a TM that accepts the input string } 101\}$ is undecidable

Published on 08 Dec 2023 - 16:19

score 42 · Answer 11 · 2023-12-09 20:13:36

42

Views

Clocked Turing Machine in Undecidability proofs

Published on 09 Dec 2023 - 20:13

score 259 · Answer 12 · 2023-12-14 14:45:44

259

Views

Turing-complete recursive function using only $a^b$ and $\log_b a$

Published on 14 Dec 2023 - 14:45

score 165 · Answer 13 · 2023-12-21 14:27:03

165

Views

A reference for undecidability of "$|A|> |B|$ implies $|\mathcal{P}(A)|>|\mathcal{P}(B)|$" in ${\rm ZFC}$.

Published on 21 Dec 2023 - 14:27

score 66 · Answer 14 · 2024-01-10 13:36:32

66

Views

How to prove that the set of theorems of any recursively axiomatized theory is a recursively enumerable set?

Published on 10 Jan 2024 - 13:36

score 66 · Answer 15 · 2024-01-14 07:19:45

66

Views

Would the Following Table Strategy Work as an Intuitionistic Decision Procedure?

Published on 14 Jan 2024 - 7:19

List Question

Is it decidable if a finite set of identities imply the commutative identity?

Decidable formal language with a finite but non-computable size

How to understand Tarski’s Real Closed Field theory result

Number of bitstrings where any subpattern repeats at most $d$ times

What is decidability and completeness?

How is $f_1(n)$ not computable but $f_2(n)$ is?

Problems with universal encoding format for Turing Machines?

Proving undecidability of a problem by showing that a single instance is undecidable

Inequality of two real numbers is semi-decidable

Help understanding the proof that $L = \{ \langle M \rangle \mid M \text{ is a TM that accepts the input string } 101\}$ is undecidable

Clocked Turing Machine in Undecidability proofs

Turing-complete recursive function using only $a^b$ and $\log_b a$

A reference for undecidability of "$|A|> |B|$ implies $|\mathcal{P}(A)|>|\mathcal{P}(B)|$" in ${\rm ZFC}$.

How to prove that the set of theorems of any recursively axiomatized theory is a recursively enumerable set?

Would the Following Table Strategy Work as an Intuitionistic Decision Procedure?

Trending Questions

Popular # Hahtags

Popular Questions