Question

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

score 201 · Answer 1 · 2018-09-27 05:36:56

201

Views

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

Published on 27 Sep 2018 - 5:36

score 110 · Answer 2 · 2018-09-28 22:16:58

110

Views

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

Published on 28 Sep 2018 - 22:16

score 142 · Answer 3 · 2018-09-28 23:52:07

142

Views

Hypertask, Arithmetical hierarchy and beyond

Published on 28 Sep 2018 - 23:52

score 568 · Answer 4 · 2018-10-12 22:49:25

568

Views

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

Published on 12 Oct 2018 - 22:49

score 314 · Answer 5 · 2018-10-22 17:18:57

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 47 · Answer 6 · 2018-10-22 20:14:54

47

Views

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

Published on 22 Oct 2018 - 20:14

score 97 · Answer 7 · 2026-03-17 18:39:25

97

Views

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

Published on 17 Mar 2026 - 18:39

score 197 · Answer 8 · 2018-11-05 09:10:58

197

Views

Problem with this generalised Rice's theorem

Published on 05 Nov 2018 - 9:10

score 3.2k · Answer 9 · 2018-11-11 12:24:38

3.2k

Views

What is a computable function?

Published on 11 Nov 2018 - 12:24

score 284 · Answer 10 · 2018-11-14 03:41:41

284

Views

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

Published on 14 Nov 2018 - 3:41

score 81 · Answer 11 · 2026-03-22 13:14:26

81

Views

Can a hypercomputer solve random sequences?

Published on 22 Mar 2026 - 13:14

score 94 · Answer 12 · 2026-02-23 01:23:47

94

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 23 Feb 2026 - 1:23

score 219 · Answer 13 · 2018-12-04 20:33:00

219

Views

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

Published on 04 Dec 2018 - 20:33

score 242 · Answer 14 · 2026-03-25 11:06:42

242

Views

Number of divisors of a number - in NP?

Published on 25 Mar 2026 - 11:06

score 223 · Answer 15 · 2018-12-16 18:07:17

223

Views

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

Published on 16 Dec 2018 - 18:07

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