User lyrically wicked

7 votes

2 answers

318 views

Is there an efficient generalized algorithm to find at least one binary word with the maximum rotational imbalance and the full $\{0, 1\}$-balance?

asked Dec 2, 2021 at 5:35

7 votes

1 answer

443 views

Gaps in the ordinals writable by Ordinal Turing Machines with a single countable parameter

asked May 6, 2023 at 4:16

5 votes

0 answers

155 views

A non-trivial (not a concatenation of de Bruijn sequences) infinite binary sequence whose initial $2^{n+1}$ bits contain all $n$-bit words for any $n$

asked Sep 25, 2023 at 3:11

5 votes

1 answer

749 views

Which ordinal is larger, the supremum of ordinals writable by iterated Infinite Time Turing Machines or the smallest $\Sigma_2^1$-reﬂecting ordinal?

asked Nov 15, 2019 at 4:26

4 votes

3 answers

495 views

How large is the supremum of halting times of Infinite Time Turing Machines, assuming that halting times are bounded and inputs are arbitrary?

asked Apr 8, 2021 at 4:22

4 votes

1 answer

337 views

How to compare three supremums of ordinals eventually writable by Ordinal Turing Machines?

asked May 4, 2021 at 4:51

4 votes

1 answer

227 views

Is there a real $x$ which is eventually writable from an ordinal parameter $\alpha < \omega_1$, but not from $\omega_1$?

asked Jul 6, 2021 at 3:02

4 votes

3 answers

403 views

Countably infinite sets of ordinals as parameters for Ordinal Turing Machines

asked Jul 13, 2021 at 4:48

4 votes

1 answer

469 views

How large are the stabilization times of Ordinal Turing Machines with an oracle for the transfinite initial ordinals?

asked Sep 23, 2021 at 5:28

4 votes

1 answer

388 views

Parities of binary weights of primes

asked Feb 23, 2022 at 4:19

4 votes

1 answer

268 views

Existence of a particular function that maps an arbitrary set of ordinals to a single ordinal

asked Jun 28, 2022 at 4:26

3 votes

3 answers

120 views

An efficient generalized algorithm to obtain an arbitrary element of a lexicographically ordered tuple of all balanced $l$-bit binary sequences

asked May 20, 2022 at 3:48

3 votes

2 answers

307 views

How to explain a particular property of the second-to-last bits of primes?

asked Feb 17, 2022 at 4:44

3 votes

2 answers

375 views

Can all lengths of shortest non-halting inputs of all Turing machines be limited by the Busy Beaver applied to the corresponding numbers of states?

asked Apr 4, 2018 at 6:17

2 votes

0 answers

95 views

A minimal size of a set of tuples for an upper bound of a distance between any pair of elements

asked May 6, 2022 at 4:10

2 votes

1 answer

369 views

Uncomputability of a function based on the Busy Beaver function

asked Jan 12, 2021 at 4:53

2 votes

0 answers

235 views

The supremum of ordinals eventually writable by Ordinal Turing Machines with an oracle for the class of stabilization ordinals

asked Jul 12, 2022 at 4:16

2 votes

1 answer

247 views

What is the meaning of $\alpha^{+L}$ for $\alpha$ an infinite countable ordinal?

asked Oct 21, 2022 at 3:10

2 votes

1 answer

168 views

Is there an efficient algorithm that allows to construct a binary word with particular properties related to its horizontal and vertical “subwords”?

asked Feb 9, 2023 at 3:19

1 vote

0 answers

122 views

A property related to representations of a number in prime bases

asked Aug 1, 2022 at 8:56

1 vote

0 answers

169 views

A function $g : \{0,1\}^m \to \{0,1\}^{4m}$ such that the “circular discrepancy” between $g(x_1)$ and $g(x_2)$ is $\geq m$ for any $x_1 \neq x_2$

asked Aug 22, 2023 at 4:46

1 vote

0 answers

53 views

Is the “amalgamation” of an enumerated infinite collection of absolutely normal real numbers always absolutely normal?

asked Dec 30, 2020 at 8:45

1 vote

0 answers

100 views

A property of $\operatorname{floor}(p/2) \bmod 2^n$ when $p$ is prime

asked Jan 13, 2022 at 4:33

1 vote

1 answer

121 views

Is there an efficient generalized algorithm to generate a set of binary words satisfying a particular cross-correlation property?

asked Apr 26, 2022 at 6:41

1 vote

0 answers

206 views

Is it possible to construct a formal language that allows to refer to specific real numbers that encode ordinals accidentally writable by an ITTM?

asked Jan 11, 2019 at 6:57

1 vote

1 answer

287 views

How large is the smallest ordinal larger than any “minimal ordinal parameter” for any pair of an Ordinal Turing Machine and a real?

asked Sep 19, 2020 at 6:52

0 votes

1 answer

174 views

Explanation of unexpectedly large offset of the first occurrence of five consecutive zeroes in the sequence of second-to-last bits of primes

asked Oct 22, 2020 at 2:12

0 votes

1 answer

244 views

How large is the supremum of minimal $V$-heights of all first-order set theories formulated in a particular language of FOST?

asked Jan 26, 2022 at 5:20

Stack Exchange Network

28 Questions

Is there an efficient generalized algorithm to find at least one binary word with the maximum rotational imbalance and the full $\{0, 1\}$-balance?

Gaps in the ordinals writable by Ordinal Turing Machines with a single countable parameter

A non-trivial (not a concatenation of de Bruijn sequences) infinite binary sequence whose initial $2^{n+1}$ bits contain all $n$-bit words for any $n$

Which ordinal is larger, the supremum of ordinals writable by iterated Infinite Time Turing Machines or the smallest $\Sigma_2^1$-reﬂecting ordinal?

How large is the supremum of halting times of Infinite Time Turing Machines, assuming that halting times are bounded and inputs are arbitrary?

How to compare three supremums of ordinals eventually writable by Ordinal Turing Machines?

Is there a real $x$ which is eventually writable from an ordinal parameter $\alpha < \omega_1$, but not from $\omega_1$?

Countably infinite sets of ordinals as parameters for Ordinal Turing Machines

How large are the stabilization times of Ordinal Turing Machines with an oracle for the transfinite initial ordinals?

Parities of binary weights of primes

Existence of a particular function that maps an arbitrary set of ordinals to a single ordinal

An efficient generalized algorithm to obtain an arbitrary element of a lexicographically ordered tuple of all balanced $l$-bit binary sequences

How to explain a particular property of the second-to-last bits of primes?

Can all lengths of shortest non-halting inputs of all Turing machines be limited by the Busy Beaver applied to the corresponding numbers of states?

A minimal size of a set of tuples for an upper bound of a distance between any pair of elements

Uncomputability of a function based on the Busy Beaver function

The supremum of ordinals eventually writable by Ordinal Turing Machines with an oracle for the class of stabilization ordinals

What is the meaning of $\alpha^{+L}$ for $\alpha$ an infinite countable ordinal?

Is there an efficient algorithm that allows to construct a binary word with particular properties related to its horizontal and vertical “subwords”?

A property related to representations of a number in prime bases

A function $g : \{0,1\}^m \to \{0,1\}^{4m}$ such that the “circular discrepancy” between $g(x_1)$ and $g(x_2)$ is $\geq m$ for any $x_1 \neq x_2$

Is the “amalgamation” of an enumerated infinite collection of absolutely normal real numbers always absolutely normal?

A property of $\operatorname{floor}(p/2) \bmod 2^n$ when $p$ is prime

Is there an efficient generalized algorithm to generate a set of binary words satisfying a particular cross-correlation property?

Is it possible to construct a formal language that allows to refer to specific real numbers that encode ordinals accidentally writable by an ITTM?

How large is the smallest ordinal larger than any “minimal ordinal parameter” for any pair of an Ordinal Turing Machine and a real?

Explanation of unexpectedly large offset of the first occurrence of five consecutive zeroes in the sequence of second-to-last bits of primes

How large is the supremum of minimal $V$-heights of all first-order set theories formulated in a particular language of FOST?