Question

Indexed family of all unary partial computable functions. The existence of computable numbering

score 71 · Answer 1 · 2020-05-15 11:38:41

Indexed family of all unary partial computable functions. The existence of computable numbering

Published on 15 May 2020 - 11:38

score 121 · Answer 2 · 2020-05-16 10:07:20

How to write a program from a predecessor function using only the clear, successor, copy, for loop and while loop commands?

score 71 · Answer 3 · 2020-05-17 04:47:42

71

Views

The family $\text{CF} \cup \left\lbrace \omega \right\rbrace$ is not computable.

Published on 17 May 2020 - 4:47

score 52 · Answer 4 · 2020-05-17 13:09:57

When formulating general recursive functions, did Godel knew that they correspond to effectively calculable functions?

score 74 · Answer 5 · 2026-03-26 12:07:44

74

Views

Existence of infinite sets of a certain property

Published on 26 Mar 2026 - 12:07

score 537 · Answer 6 · 2026-03-24 23:43:18

537

Views

Difference between Shannon Entropy limit and Kolmogorov Complexity?

Published on 24 Mar 2026 - 23:43

score 117 · Answer 7 · 2026-03-26 07:57:03

117

Views

Relative completeness of first order arithmetic

Published on 26 Mar 2026 - 7:57

score 66 · Answer 8 · 2020-05-20 00:32:28

66

Views

Show that maximal set is not recursive

Published on 20 May 2020 - 0:32

score 57 · Answer 9 · 2020-05-21 00:53:13

57

Views

Does the definite description operator generate all general recursive functions?

Published on 21 May 2020 - 0:53

score 49 · Answer 10 · 2020-05-21 15:30:07

49

Views

Creative sets (Jockush-Mohrherr)

Published on 21 May 2020 - 15:30

score 374 · Answer 11 · 2020-05-22 01:14:27

374

Views

Confusion about definitions of a universal function

Published on 22 May 2020 - 1:14

score 361 · Answer 12 · 2020-05-22 03:28:24

361

Views

The halting problem at zero

Published on 22 May 2020 - 3:28

score 558 · Answer 13 · 2026-03-25 06:01:46

558

Views

Will this function grow faster than Busy Beavers as $n \to \infty$

Published on 25 Mar 2026 - 6:01

score 233 · Answer 14 · 2026-03-27 08:55:35

233

Views

Mealy-Moore machine book recommendation

Published on 27 Mar 2026 - 8:55

score 90 · Answer 15 · 2026-02-22 22:20:52

90

Views

Question about unclear definition of Ackermann-Péter function in Stanford Encyclopedia of Philosophy

Published on 22 Feb 2026 - 22:20

List Question

Indexed family of all unary partial computable functions. The existence of computable numbering

How to write a program from a predecessor function using only the clear, successor, copy, for loop and while loop commands?

The family $\text{CF} \cup \left\lbrace \omega \right\rbrace$ is not computable.

When formulating general recursive functions, did Godel knew that they correspond to effectively calculable functions?

Existence of infinite sets of a certain property

Difference between Shannon Entropy limit and Kolmogorov Complexity?

Relative completeness of first order arithmetic

Show that maximal set is not recursive

Does the definite description operator generate all general recursive functions?

Creative sets (Jockush-Mohrherr)

Confusion about definitions of a universal function

The halting problem at zero

Will this function grow faster than Busy Beavers as $n \to \infty$

Mealy-Moore machine book recommendation

Question about unclear definition of Ackermann-Péter function in Stanford Encyclopedia of Philosophy

Trending Questions

Popular # Hahtags

Popular Questions