Calendrics: Difference between revisions
Jump to navigation
Jump to search
imported>Peter Ingerman No edit summary |
mNo edit summary |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Line 1: | Line 1: | ||
{{subpages}} | |||
Calendrics is the study of the algorithms for the generation of calendars. | '''Calendrics''' is the study of the algorithms for the generation of calendars. | ||
A <i>moment</i> is a sufficiently small piece of time. | A <i>[[moment]]</i> is a sufficiently small piece of time. | ||
A <i>day</i> 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 <i>[[day]]</i> 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 <i>date</i> is the name associated with a given day according to some calendar. | A <i>[[date]]</i> is the name associated with a given day according to some calendar. | ||
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 | == The length of a day ==[[Category:Suggestion Bot Tag]] | ||
[[Category: | |||
Latest revision as of 06:00, 24 July 2024
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
== The length of a day ==