Describes the magnitude of unnecessary excess complexity or “Rube Goldberg-ness” of a device or system. Measured in the logarithmic (base-2) unit of Goldbergs symbolized by the Greek letter gamma (Ɣ).
| 0Ɣ | the most efficient solution possible |
| 1Ɣ | 2 times unnecessary complexity |
| 2Ɣ | 4 times |
| 3Ɣ | 8 times |
| 4Ɣ | 16 times |
The most direct and simple solution that effectively solves a problem, by definition, has a rubeosity of 0Ɣ. A system that has twice the necessary complexity to perform a task, by definition, has a rubosity of 1Ɣ. Each doubling of complexity increases rubosity by 1Ɣ.
Example: “The code has an estimated rubeosity of 2 Goldbergs.”
The condition of having significantly high level of rubeosity.