Question

By what measure does the busy beaver function grow faster than any computable function?

score 981 · Answer 1 · 2026-03-26 15:16:29

981

Views

By what measure does the busy beaver function grow faster than any computable function?

Published on 26 Mar 2026 - 15:16

score 104 · Answer 2 · 2016-07-12 05:43:16

104

Views

Can every decision algorithm be expressed as a first order predicate?

Published on 12 Jul 2016 - 5:43

score 87 · Answer 3 · 2026-03-28 10:33:45

87

Views

Do all computable functions on ordinals satisfy this certain modular property?

Published on 28 Mar 2026 - 10:33

score 51 · Answer 4 · 2026-03-28 10:33:45

51

Views

Does this certain modular property hold for functions on recursive ordinals?

Published on 28 Mar 2026 - 10:33

score 202 · Answer 5 · 2016-07-14 01:36:58

202

Views

Notation for representing ANY number?

Published on 14 Jul 2016 - 1:36

score 504 · Answer 6 · 2026-03-25 20:39:45

504

Views

Meta proof-searching

Published on 25 Mar 2026 - 20:39

score 57 · Answer 7 · 2026-03-25 17:35:25

57

Views

probabilistic method for random algorithm that decide language membership

Published on 25 Mar 2026 - 17:35

score 311 · Answer 8 · 2026-03-25 19:02:21

311

Views

Examples of problems in second order arithmetic that can only be solved in third order arithmetic

Published on 25 Mar 2026 - 19:02

score 55 · Answer 9 · 2026-03-22 06:36:15

55

Views

How can {rational x where x > C} set be substantially different from {rational x where x < C} set?

Published on 22 Mar 2026 - 6:36

score 758 · Answer 10 · 2026-03-26 15:16:56

758

Views

Non-deterministic 2-tape Turing Machine to accept the language $L=\{x\#y \mid x,y \in \{0,1\}^\star, x \text{ is contained in } y\}$

Published on 26 Mar 2026 - 15:16

score 1.2k · Answer 11 · 2026-03-26 04:50:52

1.2k

Views

Show that HSC is NP-complete

Published on 26 Mar 2026 - 4:50

score 300 · Answer 12 · 2026-03-28 08:49:25

300

Views

Why can't I build a recognizer for $EQ_{TM}$ the same way as for RE-union

Published on 28 Mar 2026 - 8:49

score 908 · Answer 13 · 2016-08-01 10:04:06

908

Views

How to show that EQtm is not recognizable

Published on 01 Aug 2016 - 10:04

score 514 · Answer 14 · 2016-08-01 11:55:53

514

Views

How can know if a proof technique can actually prove something? Specifically, induction

Published on 01 Aug 2016 - 11:55

score 135 · Answer 15 · 2016-08-03 23:10:34

135

Views

Mathematically showing what is possible?

Published on 03 Aug 2016 - 23:10

List Question

By what measure does the busy beaver function grow faster than any computable function?

Can every decision algorithm be expressed as a first order predicate?

Do all computable functions on ordinals satisfy this certain modular property?

Does this certain modular property hold for functions on recursive ordinals?

Notation for representing ANY number?

Meta proof-searching

probabilistic method for random algorithm that decide language membership

Examples of problems in second order arithmetic that can only be solved in third order arithmetic

How can {rational x where x > C} set be substantially different from {rational x where x < C} set?

Non-deterministic 2-tape Turing Machine to accept the language $L=\{x\#y \mid x,y \in \{0,1\}^\star, x \text{ is contained in } y\}$

Show that HSC is NP-complete

Why can't I build a recognizer for $EQ_{TM}$ the same way as for RE-union

How to show that EQtm is not recognizable

How can know if a proof technique can actually prove something? Specifically, induction

Mathematically showing what is possible?

Trending Questions

Popular # Hahtags

Popular Questions