Question

What does it mean if a free algebra has an unsolvable word problem?

score 234 · Answer 1 · 2026-03-30 06:46:40

234

Views

What does it mean if a free algebra has an unsolvable word problem?

Published on 30 Mar 2026 - 6:46

score 1.1k · Answer 2 · 2015-12-15 15:45:21

1.1k

Views

Decidability of the satisfiability of an infinite set of propositional formulas.

Published on 15 Dec 2015 - 15:45

score 336 · Answer 3 · 2026-03-30 02:42:05

336

Views

Computable problem

Published on 30 Mar 2026 - 2:42

score 103 · Answer 4 · 2015-12-16 15:52:56

103

Views

$\alpha$-computable bounded subset of $\alpha$ is in $L_\alpha$

Published on 16 Dec 2015 - 15:52

score 196 · Answer 5 · 2026-02-23 00:02:07

196

Views

Prove $A(x,y)= 2[x](y+3)-3$. Where A is the Ackermann-Peter function and [x] is x-th hyperoperator.

Published on 23 Feb 2026 - 0:02

score 76 · Answer 6 · 2015-12-21 19:27:25

76

Views

Undecidability and the representation theory of $K<X,Y>$

Published on 21 Dec 2015 - 19:27

score 549 · Answer 7 · 2015-12-22 16:01:45

549

Views

Is Soare still the go-to comprehensive guide of computability, or should I use a different textbook?

Published on 22 Dec 2015 - 16:01

score 554 · Answer 8 · 2015-12-23 23:29:52

554

Views

Prove that this function is primitive recursive?

Published on 23 Dec 2015 - 23:29

score 160 · Answer 9 · 2015-12-24 09:11:43

160

Views

Weak and strong computability of real numbers

Published on 24 Dec 2015 - 9:11

score 155 · Answer 10 · 2026-03-27 23:01:34

155

Views

A function given a string ( a program) accepts it if the next program which halts does so in an odd number of steps... is it turing computable

Published on 27 Mar 2026 - 23:01

score 480 · Answer 11 · 2026-03-27 21:50:46

480

Views

How to define $f(x) = 2x$ as a recursive and lamba function?

Published on 27 Mar 2026 - 21:50

score 869 · Answer 12 · 2016-01-03 21:09:27

869

Views

How to argue that a set is recursive or recursively enumerable?

Published on 03 Jan 2016 - 21:09

score 277 · Answer 13 · 2026-03-28 05:25:50

277

Views

How to find an index of a computable function?

Published on 28 Mar 2026 - 5:25

score 179 · Answer 14 · 2016-01-04 09:34:21

179

Views

Definable non-computable number which contain no information

Published on 04 Jan 2016 - 9:34

score 1.9k · Answer 15 · 2016-01-04 15:36:00

1.9k

Views

How to show that a function is computable?

Published on 04 Jan 2016 - 15:36

List Question

What does it mean if a free algebra has an unsolvable word problem?

Decidability of the satisfiability of an infinite set of propositional formulas.

Computable problem

$\alpha$-computable bounded subset of $\alpha$ is in $L_\alpha$

Prove $A(x,y)= 2[x](y+3)-3$. Where A is the Ackermann-Peter function and [x] is x-th hyperoperator.

Undecidability and the representation theory of $K<X,Y>$

Is Soare still the go-to comprehensive guide of computability, or should I use a different textbook?

Prove that this function is primitive recursive?

Weak and strong computability of real numbers

A function given a string ( a program) accepts it if the next program which halts does so in an odd number of steps... is it turing computable

How to define $f(x) = 2x$ as a recursive and lamba function?

How to argue that a set is recursive or recursively enumerable?

How to find an index of a computable function?

Definable non-computable number which contain no information

How to show that a function is computable?

Trending Questions

Popular # Hahtags

Popular Questions