User blog comment:Edwin Shade/Enumerating the Countable Ordinals/@comment-25337554-20171208234807/@comment-32876686-20171209004419

By making a surjection scheme from naturals to a sufficiently large ordinal I hoped to uncover a general pattern, which might have allowed me to map each ordinal to a real number, and then create a function which inputted a real number and outputted a real ordinal, which by the reasoning that a point on the numberline chosen at random would be far beyond any current notation, (for all of Googology has really just covered an infinitesimal portion of all the numbers there are), then the resulting ordinal will likely be leagues beyond anything constructed so far, and allow me to define a hypothetically largest Googolism.

It seems though this may be impossible, but all-well, at least I learned something new: There does not exist a well-ordering of an uncountable set.