Abstract
In this paper we introduce a class of generalized sorting (ordering) problems called “classifications.” To each “classification,” we associate two quantities: informational entropy (average information quantity) and operational entropy (measure of computational complexity, that is, number of comparisons necessary to “classify” a given sequence of items). The relationship between these quantities is discussed. For a certain classification involving n items, its operational entropy is shown to be approximately n·log2n although its informational entropy is constantly equal to 1, independent of the number of items n.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.