Skip to main content
MathOverflow
lyrically wicked's user avatar
lyrically wicked's user avatar
lyrically wicked's user avatar
lyrically wicked
  • Member for 6 years, 8 months
  • Last seen more than a week ago
Profile Activity

199 Actions

All Accepts Posts Badges Comments Revisions Reviews Suggestions
revised
The supremum of ordinals eventually writable by Ordinal Turing Machines with an oracle for the class of stabilization ordinals
added 102 characters in body
revised
The supremum of ordinals eventually writable by Ordinal Turing Machines with an oracle for the class of stabilization ordinals
deleted 2 characters in body
revised
The supremum of ordinals eventually writable by Ordinal Turing Machines with an oracle for the class of stabilization ordinals
added 281 characters in body
asked
The supremum of ordinals eventually writable by Ordinal Turing Machines with an oracle for the class of stabilization ordinals
accepted
Existence of a particular function that maps an arbitrary set of ordinals to a single ordinal
revised
Existence of a particular function that maps an arbitrary set of ordinals to a single ordinal
edited body
asked
Existence of a particular function that maps an arbitrary set of ordinals to a single ordinal
revised
An efficient generalized algorithm to obtain an arbitrary element of a lexicographically ordered tuple of all balanced $l$-bit binary sequences
added 143 characters in body
comment
An efficient generalized algorithm to obtain an arbitrary element of a lexicographically ordered tuple of all balanced $l$-bit binary sequences
@MaxAlekseyev: but I did not claim that I was presenting the unranking algorithm in its entirety. The SageMath code uses the from_rank function whose underlying algorithm (called “the new unranking algorithm”) is mentioned in footnote 7 on page 12 of the paper.
comment
An efficient generalized algorithm to obtain an arbitrary element of a lexicographically ordered tuple of all balanced $l$-bit binary sequences
@kodlu: I added an explanation of how I used these algorithms to obtain the required sequences.
revised
An efficient generalized algorithm to obtain an arbitrary element of a lexicographically ordered tuple of all balanced $l$-bit binary sequences
added 659 characters in body
awarded
 Teacher
answered
An efficient generalized algorithm to obtain an arbitrary element of a lexicographically ordered tuple of all balanced $l$-bit binary sequences
comment
An efficient generalized algorithm to obtain an arbitrary element of a lexicographically ordered tuple of all balanced $l$-bit binary sequences
@BrendanMcKay: thank you for suggesting the keyword. I was not aware of the term “unranking”.
asked
An efficient generalized algorithm to obtain an arbitrary element of a lexicographically ordered tuple of all balanced $l$-bit binary sequences
accepted
How large is the supremum of minimal $V$-heights of all first-order set theories formulated in a particular language of FOST?
revised
A minimal size of a set of tuples for an upper bound of a distance between any pair of elements
deleted 279 characters in body
revised
A minimal size of a set of tuples for an upper bound of a distance between any pair of elements
added 279 characters in body
revised
A minimal size of a set of tuples for an upper bound of a distance between any pair of elements
added 2 characters in body
asked
A minimal size of a set of tuples for an upper bound of a distance between any pair of elements
1 2
3
4 5
…
10