Ultimate proof of the paradoxity of patenting (ConceptTopic, 3)
From Compile Worlds
(Difference between revisions)
Keiji (Talk | contribs)
(Created page with 'The '''ultimate proof of the paradoxity of patenting''' is as follows: #Take the full definition, in any given language (such as English) of a patent, or similarly expre...')
Newer edit →
(Created page with 'The '''ultimate proof of the paradoxity of patenting''' is as follows: #Take the full definition, in any given language (such as English) of a patent, or similarly expre...')
Newer edit →
Revision as of 16:46, 26 April 2009
The ultimate proof of the paradoxity of patenting is as follows:
- Take the full definition, in any given language (such as English) of a patent, or similarly expressed idea.
- Encode it in any given encoding (such as Unicode UTF-8 or Keiji's compact base64 encoding).
- Read the complete string of discrete quantities as a single number.
- Notice that no number can be owned by anyone, and the reverse process of 1-3 above can be applied to obtain the original definition from this number.
- Therefore, it is impossible to own (and thus patent) anything which may be expressed entirely in writing.
