MIT OpenCourseWare


» ¶i¶¥·j´M
 ½Òµ{­º­¶
 ±Ð¾Ç¤jºõ
 ±Ð¾Ç®Éµ{
 ¬ÛÃö¾\Ū¸ê®Æ
 §@·~
 ´úÅç
 ¤U¸ü½Òµ{

18.404J / 6.840J 2002¬î©u½Òµ{¡G­pºâ²z½× (Theory of Computation, Fall 2002)


¥»­¶Â½Ä¶¶i«×

¿O¸¹»¡©ú

¼f©w¡GµL
½Ķ¡G³¯·Ö(²¤¶¨Ã±H«H)
½s¿è¡G¦¶¾ÇùÚ(²¤¶¨Ã±H«H)

Image of cover of Prof. Sipser's textbook.
Sipser±Ð±Âªº±Ð¬ì®Ñ«Ê­±¹Ï¤ù¡]¹Ï¤ù¸gThomson/Course Technology±ÂÅv¨Ï¥Î¡C¡^
Image of cover of Prof. Sipser's textbook. (Courtesy of Thomson/Course Technology. Used with permission.)

½Òµ{­«ÂI

³oªù½Òµ{ªººô¯¸¥]¬A§@·~¶°¡A¤@¥÷´Á¤¤¦Ò¸Õªº¼Ë¨÷©M¦³ÃöSipser±Ð±Âªº½Ò¥»¡m­pºâ²z½×¤Jªù¡nªº¬ÛÃö¸ê°T¡C This course web site features problem sets, a sample mid-term exam, and information about Professor Sipser's textbook: Introduction to the Theory of Computation.

½Òµ{´y­z

¥»½Òµ{¤ñ18.400J ¦Û°Ê¾÷¡B¥i­pºâ©Ê©M½ÆÂø©Ê¯A¤Î­±§ó¼s¡B§ó²z½×¤Æ¡C¥D­n°¼­«©ó¥i­pºâ©Ê¡A­pºâ½ÆÂø©Ê²z½×¡A¥¿«h©M¤W¤U¤åµLÃö»y¨¥¡A¥i§P©w©M¤£¥i§P©w°ÝÃD¡A³W¬ù©Ê¡A»¼°j¨ç¼Æ²z½×¡A­pºâªº®É¶¡©MªÅ¶¡½ÆÂø©Êªº«×¶q¡A§¹³Æ©Ê¡A¤À¼h²z½×¡A©T¦³½ÆÂø°ÝÃD¡A¯«³ë¡]Oracles¡^¡A·§²v­pºâ©M¥æ¤¬±À²z¨t²Î¡C

A more extensive and theoretical treatment of the material in 18.400J, Automata, Computability, and Complexity, emphasizing computability and computational complexity theory. Regular and context-free languages. Decidable and undecidable problems, reducibility, recursive function theory. Time and space measures on computation, completeness, hierarchy theorems, inherently complex problems, oracles, probabilistic computation, and interactive proof systems.
®v¸ê
Á¿®v¡G
Michael Sipser ±Ð±Â
¤W½Ò®É¼Æ
±Ð®v±Â½Ò¡G
¨C¶g2¸`
¨C¸`1.5¤p®É

½Æ²ß/¹ê²ß½Ò¡G
¨C¶g1¸`
¨C¸`1¤p®É

µ{«×
¬ã¨s©Ò

¨ä¥L¸ê·½

¤U¸ü½Òµ{
½Ķ
¸²µå¤ú»y
¦è¯Z¤ú»y

¦^À³
§i¶D§Ú­Ì±z¹ï¥»½Òµ{©Î¡u¶}©ñ¦¡½Òµ{ºô­¶¡vªº«ØÄ³¡C
Án©ú
³Â¬Ù²z¤u¾Ç°|¶}©ñ¦¡½Òµ{»{¥i ¶}©ñ¦¡½Òµ{­pµe¡]OOPS¡^ªºÂ½Ä¶­pµe¡A¶}©ñ¦¡½Òµ{­pµe¡]OOPS¡^¤D¬O¹B¥Î¨ä¿W¥ß¹Î¶¤¡B¿W¥ß¸ê·½¡B¿W¥ß¬yµ{¶i¦æÂ½Ä¶­pµe¤§¹Î¶¤¡C

©Ò¦³³Â¬Ù²z¤u¾Ç°|¶}©ñ¦¡½Òµ{¤§§÷®Æ¬Ò¥H³Â¬Ù²z¤u¾Ç°|¶}©ñ¦¡½Òµ{³Ð§@¦@¨É±ÂÅvµo§G¡A©Ò¦³¤§Â½Ä¶¸ê®Æ¬Ò¥Ñ¶}©ñ¦¡½Òµ{­pµe¡]OOPS¡^©Ò´£¨Ñ¡A¨Ã¥Ñ¨ä­t½Ķ«~½è¤§³d¥ô¡C

¦¹³B³Â¬Ù²z¤u¾Ç°|¶}©ñ¦¡½Òµ{¤§¸ê®Æ¤D¥Ñ ¶}©ñ¦¡½Òµ{­pµe¡]OOPS¡^ ͬ°¥¿Å餤¤å¡C³Â¬Ù²z¤u¾Ç°|¶}©ñ¦¡½Òµ{¦b¦¹Án©ú¡A¤£½×¬O§_¾D¹J©Îµo²{¬ÛÃöijÃD¡A³Â¬Ù²z¤u¾Ç°|¶}©ñ¦¡½Òµ{¡B³Â¬Ù²z¤u¾Ç°|±Ð®v¡B³Â¬Ù²z¤u¾Ç°|®Õ¤è¨Ã¤£¹ï½Ķ¥¿½T«×¤Î§¹¾ã©Ê§@«OÃÒ¡C¤W­z³æ¦ì¨Ã¹ï½Ķ«á¤§¸ê®Æ¤£§@©ú¥Ü©ÎÀq³\¹ï¥ô¤@¯S©w¥Øªº¤§¾A¦X©Ê¤§«OÃÒ¡B«D«IÅv¤§«OÃÒ¡B©Î¥Ã¤£¥X¿ù¤§«OÃÒ¡C³Â¬Ù²z¤u¾Ç°|®Õ¤è¡B³Â¬Ù²z¤u¾Ç°|¶}©ñ¦¡½Òµ{¹ï½Ķ¤W¤§¤£¥¿½T¤£­t¥ô¦ó³d¥ô¡C¥Ñ½Ķ©Ò¤Þµo¥ô¦óÃö©ó¦¹µ¥¸ê®Æ¤§¤£¥¿½T©Î¨ä¥L·å²«¡A¬Ò¥Ñ¶}©ñ¦¡½Òµ{­pµe¡]OOPS¡^­t¥þ³d¡A¦Ó«D³Â¬Ù²z¤u¾Ç°|¶}©ñ¦¡½Òµ{¤§³d¡C

­ì¤åÁn©ú

 
MIT Home
Massachusetts Institute of Technology Terms of Use Privacy