Computation
Term
°áÁ¤¹®Á¦ (Entscheidungsproblem)
°è»ê (Computation)
°è»êÁÖÀÇ (Computationalism)
°è»ê°¡´É¼º
ÀÌ·Ð (Computability Theory)
°è»ê°¡´É¼º
ÀÌ·Ð (Computability Theory)
°è»êº¹ÀâµµÀÌ·Ð (Computational Complexity
Theory)
°è»êÀÌ·Ð (Theory of Computation)
°ø¸®
(Axiom)
³ú (Brain)
´ÙÇ׽İú ºñ°áÁ¤´ÙÇ×½Ä (P
and NP)
¶÷´Ù
°è»ê¹ý (Lambda Calculus)
¸¶¸£ÄÚÇÁ
¾Ë°í¸®Áò (Markov
Algorithm)
¸¶À½
(Mind)
¹®¸ÆÀÚÀ¯ ¹®¹ý (Context Free Grammar)
ºñ°áÁ¤ ³ÇØ (NP-hard)
ºñ°áÁ¤ ¿ÏÀü (NP-complete)
¼¼Æ÷
ÀÚµ¿ÀÚ (Cellular Automata)
¿ÀÅ丶Ÿ
(Automata)
¿ÀÅ丶Ÿ ÀÌ·Ð (Automata Theory)
ÀΰøÁö´É
(Artificial Intelligence)
ÀÏÂ÷ ¼ú¾î°è»ê
(First order predicate calculus)
Àç±ÍÇÔ¼ö
(Recursive Function)
Àç±ÍÇÔ¼ö
(Recursive Function)
Á¤¸® (Theorem)
Á¤Áö¹®Á¦
(Halting Problem)
óġ-Æ©¸µ
¸íÁ¦ (Church-Turing Thesis)
ÃνºÅ°°èÃþ (Chomsky Hierarchy)
Ã߷бÔÄ¢
(Inference Rule)
Æ©¸µ
±â°è (Turing
Machine)
Æ©¸µ ¸íÁ¦ (Turing
Thesis)
Æ©¸µ Å×½ºÆ®
(Turing Test)
Æ÷½ºÆ® ½Ã½ºÅÛ (Post
Systems)
Çü½Ä¾ð¾î (Formal Language)
Alan
Turing
Alonzo
Church
David Hilbert
Emil
Post
John
von Neumann
Kurt Gödel
Noam Chomsky