Beauty, Melody, and Entropy are an Equivalence Class

Suppose that we were asked to arrange the following in two categories–

distance, mass, electric force, entropy, beauty, melody.

I think there are the strongest grounds for placing entropy alongside beauty and melody and not with the first three.

Sir Arthur Stanley Eddington, OM, FRS (1882-1944), a British astronomer, physicist, and mathematician
in The Nature of the Physical World, 1927

Syndicated copies to:

WordPress

One thought on “Beauty, Melody, and Entropy are an Equivalence Class”

Mentions

Chris Aldrich

Leave a Reply Cancel reply

Upcoming Events

A Humanities Commons Twitter Conference July 18, 2019 Twitter #HCTWITTERCONF19 https://conference.hcommons.org/

Innovate Pasadena: How Crypto + Feminine Energy Can Transcend Late-Stage Capitalism July 19, 2019 at 8:15 am – 10:45 am Cross Campus, 85 N. Raymond Avenue, Pasadena, CA, US RSVP see: https://www.meetup.com/Innovation-friday-coffee-meetup/events/262111913

MATH X 451.46: Introduction to Combinatorial Analysis September 24, 2019 at 7:00 pm – 10:00 pm University of California, Los Angeles, Math Sciences Building, Room 5217, Los Angeles, CA 90095, USA https://www.uclaextension.edu/sciences-math/math-statistics/course/introduction-combinatorial-analysis-math-x-45146 Combinatorics is the branch of mathematics that deals with problems of arrangements, partitions, and designs within a given finite or discrete system. It has applications in engineering, the physical and social sciences, operations research, and computer science. This course, the first of a two-quarter sequence, is an introductory yet rigorous survey of the theory…

MATH X 451.46: Introduction to Combinatorial Analysis October 1, 2019 at 7:00 pm – 10:00 pm University of California, Los Angeles, Math Sciences Building, Room 5217, Los Angeles, CA 90095, USA https://www.uclaextension.edu/sciences-math/math-statistics/course/introduction-combinatorial-analysis-math-x-45146 Combinatorics is the branch of mathematics that deals with problems of arrangements, partitions, and designs within a given finite or discrete system. It has applications in engineering, the physical and social sciences, operations research, and computer science. This course, the first of a two-quarter sequence, is an introductory yet rigorous survey of the theory…

MATH X 451.46: Introduction to Combinatorial Analysis October 8, 2019 at 7:00 pm – 10:00 pm University of California, Los Angeles, Math Sciences Building, Room 5217, Los Angeles, CA 90095, USA https://www.uclaextension.edu/sciences-math/math-statistics/course/introduction-combinatorial-analysis-math-x-45146 Combinatorics is the branch of mathematics that deals with problems of arrangements, partitions, and designs within a given finite or discrete system. It has applications in engineering, the physical and social sciences, operations research, and computer science. This course, the first of a two-quarter sequence, is an introductory yet rigorous survey of the theory…

MATH X 451.46: Introduction to Combinatorial Analysis October 15, 2019 at 7:00 pm – 10:00 pm University of California, Los Angeles, Math Sciences Building, Room 5217, Los Angeles, CA 90095, USA https://www.uclaextension.edu/sciences-math/math-statistics/course/introduction-combinatorial-analysis-math-x-45146 Combinatorics is the branch of mathematics that deals with problems of arrangements, partitions, and designs within a given finite or discrete system. It has applications in engineering, the physical and social sciences, operations research, and computer science. This course, the first of a two-quarter sequence, is an introductory yet rigorous survey of the theory…