Ridiculous Procedures

[PkmnQ]

Procedures that work but are too ridiculous to perform.
Example: Quantum Bogo Sort

1. Quantumly randomise the list, such that there is no way of knowing what order the list is in until it is observed. This will divide the universe into O(n!) universes; however, the division has no cost, as it happens constantly anyway.
2. If the list is not sorted, destroy the universe.
3. All remaining universes contain lists which are sorted.

[Hunting]

Clever. That will work for every problem.

For example, find a c/18 spaceship in CGoL:

Generates 1000x1000 soup.

If it is not a c/18 spaceship, destroy the universe.

[praosylen]

Realistically, if you decide to try any of these things, assuming you have a real way of destroying the universe, either increasingly strange coincidences will start to occur preventing you from conducting the procedure in the first place, or you'll find yourself inexplicably chickening out at the last second from destroying the universe, or even if you find a chicken-proof means of destroying the universe, such as an unstoppable timed destruct, it'll keep failing in every possible way, both mundane and absurd — more and more so on all of this as solutions get rarer in the search space of the problem you're trying to solve. (This is assuming my understanding of quantum causality is correct, which it almost certainly isn't.)

[Moosey]

I challenge you to make a sorting system which involves (both finite and transfinite) ordinals (not sorting ordinals, which is easy, but the algorithm itself uses some ordinal for something)

[Hunting]

I challenge you to make a sorting system which involves (both finite and transfinite) ordinals (not sorting ordinals, which is easy, but the algorithm itself uses some ordinal for something)

Tell Moosey to sort the list.

[PkmnQ]

I challenge you to make a sorting system which involves (both finite and transfinite) ordinals (not sorting ordinals, which is easy, but the algorithm itself uses some ordinal for something)

Maybe using a collapsing ordinal thing.

[testitemqlstudop]

I challenge you to make a sorting system which involves (both finite and transfinite) ordinals (not sorting ordinals, which is easy, but the algorithm itself uses some ordinal for something)

Easy.

First, use pkmnq's quantum oracle to prove continuum hypothesis on every "countable segment": 0 to W_1, W_1 to W_2, etc.
Take some ridiculously strong OCF T:a|->b that maintains order. Define the inverse U:a|->b as min{b:T(b)=a}.
For each ordinal in the array apply U some arbitrary but constant amount of times V.
W_[literally anything] is well-ordered, so map all ordinals to a transfinite V-dimensional sequence of 0/1 and maintain the same lexicographic order.
Sort (taking a transfinite amount of time)

[testitemqlstudop]

Procedures that work but are too ridiculous to perform.
Example: Quantum Bogo Sort

1. Quantumly randomise the list, such that there is no way of knowing what order the list is in until it is observed. This will divide the universe into O(n!) universes; however, the division has no cost, as it happens constantly anyway.
2. If the list is not sorted, destroy the universe.
3. All remaining universes contain lists which are sorted.

What's the difference between bogosort (O(n!*n)) and this (also O(n!*n)) except that this is basically the same as adding n! cores to your computer?
This is still bounded at O(n), due to the limit on deciding whether or not an array is sorted.

[testitemqlstudop]

Also, there are sorting algorithms with O(|A| log_K max(A)) - linked list radix sort with base K.

[Moosey]

I challenge you to make a sorting system which involves (both finite and transfinite) ordinals (not sorting ordinals, which is easy, but the algorithm itself uses some ordinal for something)

Easy.

First, use pkmnq's quantum oracle to prove [the generalized] continuum hypothesis on every "countable segment": 0 to W_1, W_1 to W_2, etc.

"Countable segment"
None of the segments are countable in length

Take some ridiculously strong OCF T:a|->b that maintains order. Define the inverse U:a|->b as min{b:T(b)=a}.

You have to define a and b first, no? Also, if T is a|->b, its inverse, U, is b|->a. if U is a|->b then T is b|->a AND a|->b and therefore closed under the larger