George Pólya
(Çë°¡¸® ¼öÇÐÀÚ, 1887~1985)
......... Polya´Â ÈÞ¸®½ºÆ½ (Heuristic) À» 20¼¼±â¿¡ ºÎÈï½ÃŲ ÇÐÀÚÀÌ´Ù. Polya ÀÇ ÈÞ¸®½ºÆ½Àº ¹®Á¦Çذá (Problem Solving) ±³À°À» À§ÇÑ »ç°í ±³À°ÀÌ¸ç ¾Ë°í¸®ÁòÈ µÉ ¼ö ¾ø´Ù´Â °ÍÀÌ´Ù. 1930³â Kurt Gödel ÀÇ ºÒ¿ÏÀü¼ºÀÇ Á¤¸®°¡ ³ª¿À±â ÀÌÀü±îÁö´Â ¼öÇп¡¼ ¸ðµç ¹®Á¦¿¡ Àû¿ëÇÒ ¼ö ÀÖ´Â ¾Ë°í¸®Áò (Algorithm) ÀÌ ÀÖ´Ù°í ¹Ï¾ú¾ú´Âµ¥ ±Ëµ¨ÀÇ ºÒ¿ÏÀü¼º Á¤¸® (Incompleteness Theorem) ·Î ±×·¯ÇÑ ¾Ë°í¸®ÁòÀÌ Á¸ÀçÇÒ¼ö ¾øÀ½ÀÌ Áõ¸íµÈÈÄ ÈÞ¸®½ºÆ½ÀÇ ¿¬±¸°¡ ¶äÇØ Á³¾ú´Ù. ........ Æú¸®¾Æ´Â ¹®Á¦ÇذáÀÇ ´Ü°è¸¦ 4´Ü°è·Î º¸¾Ò´Ù. ¹®Á¦¿¡ ´ëÇÑ ÀÌÇØ (see) -> °èȹ (plan) -> ½ÇÇà (do) -> ¹Ý¼º (check) ÀÇ ´Ü°è·Î¼ ¹ß°ß Àü·«À» °Á¶ÇÏ¿´´Ù. ¶ÇÇÑ ÇнÀÀÇ ¿ø¸®¸¦ 3°¡Áö Á¦½ÃÇÏ¿´´Ù. ºñ¾à¾ø´Â ´Ü°èÀÇ ¿ø¸®. ÃÖ¼±ÀÇ µ¿±âÀ¯¹ßÀÇ ¿ø¸®. Ȱµ¿Àû ÇнÀÀÇ ¿ø¸®... ÇнÀÀÇ ´Ü°è¿ª½Ã 3´Ü°è·Î º¸¾Ò´Ù...... Æú¸®¾ÆÀÇ ÈÞ¸®½ºÆ½Àº Á¤º¸Ã³¸®¸é¿¡¼ 20¼¼±â¿¡ ÁÖ¸ñ¹Þ¾Ò´Ù.........
George Pólya (Çë°¡¸®¾î·Î´Â Pólya György) ´Â Çë°¡¸®ÀÇ ºÎ´ÙÆä½ºÆ®¿¡¼ ž ¹Ì±¹¿¡¼ »ç¸ÁÇÑ ¼öÇÐÀÚÀÌ´Ù. ±×´Â ¼öÇÐÀÇ ¿©·¯ºÐ¾ß Áï series, number theory, combinatorics, probability ºÐ¾ßÀÇ ¿¬±¸¸¦ ÇÏ¿´´Ù. ¸»³â¿¡´Â ¹®Á¦¸¦ ÇØ°áÇÏ´Â ÀϹÝÀûÀÎ ¹æ¹ýÀ» Ư¼ºÈÇϰí, ¹®Á¦Çذá (Problem Solving) À» ¾î¶»°Ô °¡¸£Ä¡°í ¹è¿ì´ÂÁö¸¦ ¿¬±¸Çϴµ¥ ´ëºÎºÐÀÇ ³ë·ÂÀ» ±â¿ï¿´´Ù. ±×·¯ÇÑ ÁÖÁ¦·Î 3 ±ÇÀÇ Ã¥À» ½è´Ù. Áï How to Solve It, Mathematics of Plausible Reasoning Volume I: Induction and Analogy in Mathematics, and Mathematics of Plausible Reasoning Volume II: Patterns of Plausible Reasoning. ÀÌ ±×°ÍÀÌ´Ù.
How to Solve It ¿¡¼´Â ´Ü¼øÈ÷ ¼öÇй®Á¦°¡ ¾Æ´Ï¶ó ¸ðµç Á¾·ùÀÇ ¹®Á¦¸¦ ÇØ°áÇϱâÀ§ÇÑ ÀÏ¹Ý ÈÞ¸®½ºÆ½ (general heuristics) À» ¿¬±¸ÇÏ¿´´Ù. ±× Ã¥¿¡´Â Çлý¿¡°Ô ¼öÇÐÀ» °¡¸£Ä¡´Âµ¥ µµ¿òÀÌ µÇ´Â ¸»°ú ÈÞ¸®½ºÆ½ ¿ë¾îÀÇ ¹Ì´Ï »çÀüÀ» Æ÷ÇÔÇÑ´Ù. ¿©·¯³ª¶ó¿¡¼ ¹ø¿ªµÇ¾î ¹é¸¸±Ç ÀÌ»ó ÆÈ·È´Ù. ·¯½Ã¾ÆÀÇ ¹°¸®ÇÐÀÚ Zhores I. Alfyorov (2000³â Nobel »ó ¼ö»óÀÚ) ´Â ±×ÀÇ Ã¥À» °ÝÂùÇÏ¿´´Ù.
Mathematics of Plausible Reasoning Volume I ¿¡¼´Â Ưº°ÇÑ »ç·Ê·ÎºÎÅÍ ÀÏ¹Ý ±ÔÄ¢À» Ãß·ÐÇÏ´Â °ÍÀ» ÀǹÌÇÏ´Â ¼öÇп¡¼ÀÇ ±Í³³Ãß·Ð (inductive reasoning) À» ¿¬±¸ÇÏ¿´´Ù. (±×ÀÇ ¼öÇÐ ÁÖÁ¦´Â ¾Æ´ÏÁö¸¸ ÇÑ chapter ºÐ·®À¸·Î ¼öÇÐÀû ±Í³³¹ý (mathematical induction) À» ´Ù·ç¾ú´Ù). Mathematics of Plausible Reasoning Volume II ¿¡¼´Â ÇϳªÀÇ ÃßÃø (conjecture, ƯÈ÷ ¼öÇÐÀû ÃßÃø) ÀÌ ¾î´ÀÁ¤µµ·Î ±×·²µíÇÑÁö (plausible) ¸¦ ´ë° °áÁ¤ÇϱâÀ§ÇØ »ç¿ë°¡´ÉÇÑ ÀϹÝÀûÀÎ ÇüÅÂÀÇ ±Í³³³í¸® (inductive logic) ¸¦ ´Ù·ç¾ú´Ù........... (Wikipedia : George Pólya)
¸í¾ð :
term :
George Pólya ÈÞ¸®½ºÆ½ (Heuristic) ¹®Á¦Çذá (Problem Solving) ±Í³³¹ý (Induction) Ãß·Ð (Reasoning) Kurt Gödel ¾Ë°í¸®Áò (Algorithm) ºÒ¿ÏÀü¼º Á¤¸® (Incompleteness Theorem) Polya-Burnside counting theorem Hilbert-Pólya conjecture
paper :
site :
video :
Æú¸®¾Æ°¡ µé·ÁÁÖ´Â ¹®Á¦Çذá Àü·« À̾߱â 1/3 : ÀÚÀ½°ú ¸ðÀ½, 2013/11/03
Æú¸®¾Æ°¡ µé·ÁÁÖ´Â ¹®Á¦Çذá Àü·« À̾߱â 2/3 : ÀÚÀ½°ú ¸ðÀ½, 2013/11/03
Æú¸®¾Æ°¡ µé·ÁÁÖ´Â ¹®Á¦Çذá Àü·« À̾߱â 3/3 : ÀÚÀ½°ú ¸ðÀ½, 2013/11/03