Question

Does there exist a strict numeric measure of the strength for any set theory (relative to a corresponding proof-theoretic ordinal)?

score 204 · Answer 1 · 2026-04-08 21:05:44

204

Views

Does there exist a strict numeric measure of the strength for any set theory (relative to a corresponding proof-theoretic ordinal)?

Published on 08 Apr 2026 - 21:05

score 115 · Answer 2 · 2026-04-17 05:07:22

115

Views

Is there a good notion of hypercomputation which allows inaccessible-length computations?

Published on 17 Apr 2026 - 5:07

score 145 · Answer 3 · 2026-04-11 05:08:27

145

Views

Hypertask, Arithmetical hierarchy and beyond

Published on 11 Apr 2026 - 5:08

score 571 · Answer 4 · 2026-04-12 05:43:24

571

Views

Functions corresponding to Turing machines that might not halt but consume bounded tape

Published on 12 Apr 2026 - 5:43

score 317 · Answer 5 · 2026-04-15 16:32:27

Turing machine that accepts strings $w$ of ${a,b,c}$ where $w = a^i b^j c^k$ and $i\ge j$, $j\ge k$, and $i,j,k \ge 0$

score 50 · Answer 6 · 2026-04-08 17:02:41

50

Views

Is a Turing Machine with access to an entropy source "more powerful" than an ordinary TM?

Published on 08 Apr 2026 - 17:02

score 101 · Answer 7 · 2026-04-14 17:02:25

101

Views

Can I give undefined ($\perp$) as an argument to my function?

Published on 14 Apr 2026 - 17:02

score 200 · Answer 8 · 2026-04-12 14:10:43

200

Views

Problem with this generalised Rice's theorem

Published on 12 Apr 2026 - 14:10

score 3.2k · Answer 9 · 2026-04-30 13:09:32

3.2k

Views

What is a computable function?

Published on 30 Apr 2026 - 13:09

score 287 · Answer 10 · 2026-04-13 04:51:59

287

Views

Does my solution show that the language is uncomputable by applying rice's theorem?

Published on 13 Apr 2026 - 4:51

score 83 · Answer 11 · 2026-05-10 13:45:06

83

Views

Can a hypercomputer solve random sequences?

Published on 10 May 2026 - 13:45

score 95 · Answer 12 · 2026-04-09 04:14:59

95

Views

Undecidability of: $|w \in L| \geq 1, L=\{w \in \{0,1\}^*|a_0·\#_0(w)+a_1·\#_1(w)- a_1a_0=0\}$

Published on 09 Apr 2026 - 4:14

score 222 · Answer 13 · 2026-04-14 22:18:55

222

Views

A version of a Turing maching that can cut out and/or remove tape squares

Published on 14 Apr 2026 - 22:18

score 246 · Answer 14 · 2026-05-04 10:59:41

246

Views

Number of divisors of a number - in NP?

Published on 04 May 2026 - 10:59

score 226 · Answer 15 · 2026-04-11 08:17:14

226

Views

How to prove that class of “recursive” and “recursively enumerable” languages are not equal?

Published on 11 Apr 2026 - 8:17

List Question

Does there exist a strict numeric measure of the strength for any set theory (relative to a corresponding proof-theoretic ordinal)?

Is there a good notion of hypercomputation which allows inaccessible-length computations?

Hypertask, Arithmetical hierarchy and beyond

Functions corresponding to Turing machines that might not halt but consume bounded tape

Turing machine that accepts strings $w$ of ${a,b,c}$ where $w = a^i b^j c^k$ and $i\ge j$, $j\ge k$, and $i,j,k \ge 0$

Is a Turing Machine with access to an entropy source "more powerful" than an ordinary TM?

Can I give undefined ($\perp$) as an argument to my function?

Problem with this generalised Rice's theorem

What is a computable function?

Does my solution show that the language is uncomputable by applying rice's theorem?

Can a hypercomputer solve random sequences?

Undecidability of: $|w \in L| \geq 1, L=\{w \in \{0,1\}^*|a_0·\#_0(w)+a_1·\#_1(w)- a_1a_0=0\}$

A version of a Turing maching that can cut out and/or remove tape squares

Number of divisors of a number - in NP?

How to prove that class of “recursive” and “recursively enumerable” languages are not equal?

Trending Questions

Popular # Hahtags

Popular Questions