Calendrics: Difference between revisions
Jump to navigation
Jump to search
imported>Peter Ingerman No edit summary |
imported>Peter Ingerman No edit summary |
||
| Line 1: | Line 1: | ||
== Introduction == | |||
Calendrics is the study of the algorithms for the generation of calendars. | Calendrics is the study of the algorithms for the generation of calendars. | ||
| Line 8: | Line 10: | ||
Finally, a <i>calendar</i> is an algorithm for systematically assigning names to dates | Finally, a <i>calendar</i> is an algorithm for systematically assigning names to dates | ||
== The Length of a Day == | |||
[[Category:Mathematics Workgroup]] | [[Category:Mathematics Workgroup]] | ||
Revision as of 10:54, 19 May 2007
Introduction
Calendrics is the study of the algorithms for the generation of calendars.
A moment is a sufficiently small piece of time.
A day is a contiguous set of moments lasting approximately twentyfour hours. The precise length of a day depends on how the day is defined in the context of a particular calendar.
A date is the name associated with a given day according to some calendar.
Finally, a calendar is an algorithm for systematically assigning names to dates