The Year-2000 Problem and the New Riddle of Induction - Hal Berghel Y2K ¹®Á¦¿Í ±Í³³¹ýÀÇ »õ·Î¿î ¼ö¼ö²²³¢ °³¿ä Y2K problem ¶Ç´Â ¹Ð·¹´Ï¾ö ¹ö±×¶ó ºÒ¸®¿ì´Â ¹®Á¦´Â 2000³âÀÌ µÇ¸é ÄÄÇ»ÅÍ(¼ÒÇÁÆ®¿þ¾î¿Í Çϵå¿þ¾î ¸ðµÎ)µéÀÌ 2000³âÀ» 1900³âÀ¸·Î ÀνÄÇÏ°Ô µÇ¾î ¿©·¯ »ç°í°¡ ¹ß»ýÇÒ ¼ö ÀÖ´Ù´Â ¹®Á¦¸¦ ¸»ÇÑ´Ù. Wegner Algorithmic computing is weaker than interactive computing. Interaction machine cannot be expressed by Turing machines and by first-order logic. BerghelÀÇ ¹Ý·Ð Practical interactive services like banking or airline reservations cannot inherently be realized by non-interactive(Turing machine) systems. Year-2000(Y2K) problemÀº turing machineÀÌ °¡Áö´Â À§¿Í °°Àº ¹®Á¦Á¡À» µå·¯³»´Â ¿¹ÀÌ´Ù. Y2K ¹®Á¦°¡ ÀϾ ¼ö ÀÖ°Ô µÈ ¿ª»çÀû ¹è°æÀº ´ÙÀ½°ú °°´Ù. ½Ã½ºÅÛ °³¹ßÀ» ¿ä±¸ÇÑ ±â¾÷µéÀº memory¸¦ ¾Æ³¢±â À§ÇØ ³¯Â¥¸¦ ÀúÀåÇÏ´Â º¯¼ö¸¦ °Ü¿ì 2¹ÙÀÌÆ® Á¤µµÀÇ Å©±â·Î Á¦ÇÑÇϵµ·Ï °³¹ß¾÷ü¿¡ ÁÖ¹®ÇÏ¿´´Ù. ¸î ¹ÙÀÌÆ®¸¸ ´õ »ç¿ëÇß´õ¶óµµ žçÀÇ ¼ö¸íÀ» ³Ñ±â´Â ½Ã°£µ¿¾È ±×·¯ÇÑ ¹®Á¦°¡ ¹ß»ýÇÏÁö ¾ÊÀ» ¼ö ÀÖ¾ú´ø °ÍÀÌ´Ù. DOS ((year-1980)*512)+(month*32)+day Unix 70³â 1¿ù 1ÀϺÎÅÍ 2*31ÃÊ = 2038³â 1¿ù 18ÀÏ ÁöÁúÇÐÀûÀÎ ½Ã°£ 40¾ï³â 64 bits = 8 bytes InductionÀÇ ¼ö¼ö²²³¢ old riddle : ±Í³³¹ýÀº Á¤´çÈ­¸¦ Çϱâ À§ÇØ ¸ðµç °ÍÀÌ °¡¼³À» ¸¸Á·½ÃÄÑ¾ß Çϴµ¥, '¸ðµç' °Í¿¡ ´ëÇؼ­ °¡¼³À» Àû¿ëÇØ º¼ ¼ö°¡ ¾ø´Ù. --> ¼öÇÐÀû ±Í³³¹ý, ¿øÃÊÀû º»´É(?), ´Ü¼øÈ­ µî¿¡ ÀÇÇØ ÇØ¼ÒµÉ ¼ö ÀÖ´Â ¹®Á¦ÀÌ´Ù. new riddle : ÀÓÀÇÀÇ ½Ã°¢ t¿¡ ´ëÇؼ­ °¡¼³À» ¸¸Á·Çß´Ù°í Çؼ­ t ÀÌÈÄ¿¡µµ ¸¸Á·ÇÑ´Ù°í ÁÖÀåÇÒ ¼ö ¾ø´Ù. Y2K¹®Á¦´Â ¹Ù·Î ÀÌ·¯ÇÑ ±Í³³¹ýÀÇ paradox¿¡ ÀÇÇؼ­ ¹ß»ýÇÏ´Â ¹®Á¦ÀÌ´Ù. ÇØ°á ¹Ì±¹ ³» ¼ÒÇÁÆ®¿þ¾îÀÇ Y2K¹®Á¦¸¦ ÇØ°áÇϱâ À§ÇØ ÇÊ¿äÇÑ ºñ¿ëÀº ¾à 700¾ï ´Þ·¯À̸ç, Áß°£±ÞÀÇ È¸»ç°¡ 95³â¿¡ ¹ö±×¸¦ Àâ±â À§ÇØ ÇÁ·ÎÁ§Æ®¸¦ ½ÃÀÛÇÏ´Â °ÍÀÌ ¹Ù¶÷Á÷Çϸç, 97³â 10¿ùÀÌ ±× ¸¶Áö¸· ½Ã±â¶ó°í ÇÑ´Ù.