When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Year 2038 problem - Wikipedia

    en.wikipedia.org/wiki/Year_2038_problem

    There is no universal solution for the Year 2038 problem. For example, in the C language, any change to the definition of the time_t data type would result in code-compatibility problems in any application in which date and time representations are dependent on the nature of the signed 32-bit time_t integer.

  3. Time formatting and storage bugs - Wikipedia

    en.wikipedia.org/wiki/Time_formatting_and...

    The Network Time Protocol has an overflow issue related to the Year 2038 problem, which manifests itself at 06:28:16 UTC on 7 February 2036, rather than 2038. The 64-bit timestamps used by NTP consist of a 32-bit part for seconds and a 32-bit part for fractional second, giving NTP a time scale that rolls over every 2 32 seconds (136 years) and ...

  4. Epoch (computing) - Wikipedia

    en.wikipedia.org/wiki/Epoch_(computing)

    Many Unix-like operating systems which keep time as seconds elapsed from the epoch date of 1 January 1970, and allot timekeeping enough storage to store numbers as large as 2 147 483 647 will experience an overflow problem on 19 January 2038. This is known as the Year 2038 problem.

  5. 2,147,483,647 - Wikipedia

    en.wikipedia.org/wiki/2,147,483,647

    The latest time that can be represented in this form is 03:14:07 UTC on Tuesday, 19 January 2038 (corresponding to 2,147,483,647 seconds since the start of the epoch). This means that systems using a 32-bit time_t type are susceptible to the Year 2038 problem. [9]

  6. GPS week number rollover - Wikipedia

    en.wikipedia.org/wiki/GPS_week_number_rollover

    The GPS week number rollover is a phenomenon that happens every 1,024 weeks, which is about 19.6 years. The Global Positioning System (GPS) broadcasts a date, including a week number counter that is stored in only ten binary digits, whose range is therefore 0–1,023.

  7. Talk:Year 2038 problem/Archive 2 - Wikipedia

    en.wikipedia.org/wiki/Talk:Year_2038_problem/...

    There is no universal solution for the Year 2038 problem. Any change to the definition of the time_t data type would result in code compatibility problems in any application in which date and time representations are dependent on the nature of the signed 32-bit time_t integer.

  8. Leap year problem - Wikipedia

    en.wikipedia.org/wiki/Leap_year_problem

    The leap year problem (also known as the leap year bug or the leap day bug) is a problem for both digital (computer-related) and non-digital documentation and data storage situations which results from errors in the calculation of which years are leap years, or from manipulating dates without regard to the difference between leap years and common years.

  9. x32 ABI - Wikipedia

    en.wikipedia.org/wiki/X32_ABI

    That same day, Linus Torvalds replied with a concern that the use of 32-bit time values in the x32 ABI could cause problems in the future. [11] [12] This is because the use of 32-bit time values would cause the time values to overflow in the year 2038. [11] [12] Following this request, the developers of the x32 ABI changed the time values to 64 ...