ตารางด้านล่างแสดงกลุ่มของปัญหา (หรือภาษา หรือไวยากรณ์) ที่พิจารณาในทฤษฎีการคำนวณได้. ถ้ากลุ่ม X เป็นซับเซ็ตแท้ของ Y เราจะแสดง X ด้านล่าง Y และมีเส้นทึบเชื่อมระหว่างสองกลุ่ม. ถ้า X เป็นซับเซ็ตแต่ไม่ทราบแน่นอนว่าจะเท่ากันหรือไม่ เราจะเชื่อมด้วยเส้นที่บางกว่าและเป็นเส้นประ.
Garey, Michael R., and David S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W. H. Freeman & Co., 1979. The standard reference on NP-Complete problems - an important category of problems whose solutions appear to require an impractically long time to compute.
Hein, James L: Theory of Computation. Sudbury, MA: Jones & Bartlett, 1996. A gentle introduction to the field, appropriate for second-year undergraduate computer science students.
Hopcroft, John E., and Jeffrey D. Ullman: Introduction to Automata Theory, Languages, and Computation. Reading, MA: Addison-Wesley, 1979. One of the standard references in the field.
Taylor, R. Gregory: Models of Computation. New York: Oxford University Press, 1998. An unusually readable textbook, appropriate for upper-level undergraduates or beginning graduate students.
The Complexity Zoo 2007-11-18 ที่ เวย์แบ็กแมชชีน: A huge list of complexity classes, as reference for experts.
Computability Logic 2011-04-11 ที่ เวย์แบ็กแมชชีน: A theory of interactive computation. The main web source on this new subject.
ดูเพิ่ม
Computability logic
Interactive computation
Important publications in computability
Open problems in computability
Calculation
มีนาคม 08, 2022
ทฤษฎ, การคำนวณ, งก, ามภาษา, ในบทความน, ไว, ให, านและผ, วมแก, ไขบทความศ, กษาเพ, มเต, มโดยสะดวก, เน, องจากว, เด, ยภาษาไทยย, งไม, บทความด, งกล, าว, กระน, ควรร, บสร, างเป, นบทความโดยเร, วท, ดการศ, กษาเก, ยวก, เร, มข, นเม, อต, นศตวรรษท, อนจะม, การค, ดค, นคอมพ, วเตอ. lingkkhamphasa inbthkhwamni miiwihphuxanaelaphurwmaekikhbthkhwamsuksaephimetimodysadwk enuxngcakwikiphiediyphasaithyyngimmibthkhwamdngklaw krann khwrribsrangepnbthkhwamodyerwthisudkarsuksaekiywkb thvsdikarkhanwn erimkhunemuxtnstwrrsthiyisib kxncamikarkhidkhnkhxmphiwetxrxielkthrxnikskhuninchwngewladngklaw nkkhnitsastriderimsuksawa pyhathangkhnitsastridbangthisamarthaekiddwywithiphunthan aelapyhaidthiimsamarthaekid khntxnaerkkkhuxkarniyamihidwawithiphunthaninkaraekpyhannkhuxxairbang nnkhux phwkekhatxngkaromedlxyangepnthangkarkhxngkarkhanwn formal model of computation idmikarsrangomedlinrupaebbtang makmay omedlekhruxngckrthwringmxngkarkhanwnepnkarthangankhxngekhruxngckrthithanganbnethpekbtwxksrthimikhwamyawimcakd odymihwxan ekhiynthicathangankbchxngbnethpthilachxng xikomedlhnungphicarnakarkhanwnphanthangfngkchnewiynbngekid sungichfngkchnaelakarprakxbkn composition khxngfngkchnthithanganbntwelkh omedlaelmdaaekhlkhulsichwithikhlaykn nxkcakniyngmiomedlxun echn khntxnwithikhxngmakhxfaelarabbkhxngophstthiichiwyakrnbnstring omedlthangkartangehlaniidrbkaraesdngwamikhwamsamarthethiybethakn nnkhux karkhanwnidthikrathaidodyomedlhnungcasamarththaidinxikomedldwyechnkn omedlehlaniyngmikhwamsamarthethaknkbekhruxngkhxmphiwetxrthwipthieraichxyu thaerasmmtiwaekhruxngkhxmphiwetxrnnmihnwykhwamcaimrucbnxkcakni yngepnthiechuxknxikwa thuk omedlkarkhanwnthi smehtusmphl camikhwamsamarthethiybethakbekhruxngckrthwring sungkhwamechuxnieriykwa khxpyhakhxngechirch thwring Church Turing thesis sastrthisuksaekiywkbkhxbekhtkhxngpyhathikhanwniddwyomedlkhxngekhruxngckraebbtangnnkhux thvsdikarkhanwnidthvsdikarkhanwnsuksaomedlkarkhanwn phrxmkbkhidcakdkhxngkarkhanwn echn pyhaidthisamarthphisucnidwaimsamarthaekiddwykhxmphiwetxr du pyhakaryutikarthangan hrux pyhakhwamsmphnthkhxngophst pyhaidbangthisamarthaekikhiddwykhxmphiwetxr aettxngkarewlamhasalcnthaihkarhakhatxbnnepnipimid du en Presburger arithmetic karhakhatxbyakkwakartrwckhatxbkhxngpyhahruxim du klumkhwamsbsxn phi aela exnphi sastrthisuksaekiywkbewlaaelaenuxthithitxngkarsahrbpyhatang khux thvsdikhwamsbsxninkarkhanwnnxkcakomedlinkarkhanwnthwipaelw yngmirupaebbinkarkhanwnxun thingaykwann echn omedlkhxngniphcnprkti thiepnwithithiichkahndrupaebbkhxngstringinyuniks aelainbangphasakhxmphiwetxr echn phasaephirl odymiomedl echn ekhruxngckrsthanacakdthimikhwamsamarthethiybethakn omedlthimikhwamsamarthkwaomedlniphcn regular echn omedlthixthibaykarkhanwnphanthangiwyakrnimphungbribth context free grammar ichsahrbrabuiwyakrnkhxngphasaopraekrm odythimiekhruxngckrkdlng pushdown automata epnxikrupaebbthiethiybethakn fngkchnewiynbngekidphunthankepnomedlyxykhxngfngkchnewiynbngekidomedlthiaetktangknxacmikhwamsamarththiaetktangknid xikwithihnungthicawdkhwamsamarthkhxngomedltang kkhuxkarsuksaklumkhxngphasathangkar formal language thiomedlehlannsamarthsrangid yktwxyangechn ekhruxngckrsthanacakdsamarthsrangidephiyngphasathiethiybethakbniphcn regular swnekhruxngckrkdlngnnsamarthsrangphasathirabudwyiwyakrnimphungbribthiddwy radbkhwamsamarththangphasathangkarkhxngomedlehlaniepnthimakhxngradbchnkhxng Chomskytarangdanlangaesdngklumkhxngpyha hruxphasa hruxiwyakrn thiphicarnainthvsdikarkhanwnid thaklum X epnsbestaethkhxng Y eracaaesdng X danlang Y aelamiesnthubechuxmrahwangsxngklum tha X epnsbestaetimthrabaennxnwacaethaknhruxim eracaechuxmdwyesnthibangkwaaelaepnesnpra pyhakartdsinicType 0 Recursively enumerable UndecidableDecidableEXPSPACEEXPTIMEphisepsType 1 Context Sensitive phisepsbriburnokh exnphi exnphiBPP BQP exnphibriburnphiNC phibriburnType 2 Context Free Type 3 Regular xangxing aekikhGarey Michael R and David S Johnson Computers and Intractability A Guide to the Theory of NP Completeness New York W H Freeman amp Co 1979 The standard reference on NP Complete problems an important category of problems whose solutions appear to require an impractically long time to compute Hein James L Theory of Computation Sudbury MA Jones amp Bartlett 1996 A gentle introduction to the field appropriate for second year undergraduate computer science students Hopcroft John E and Jeffrey D Ullman Introduction to Automata Theory Languages and Computation Reading MA Addison Wesley 1979 One of the standard references in the field Taylor R Gregory Models of Computation New York Oxford University Press 1998 An unusually readable textbook appropriate for upper level undergraduates or beginning graduate students The Complexity Zoo Archived 2007 11 18 thi ewyaebkaemchchin A huge list of complexity classes as reference for experts Computability Logic Archived 2011 04 11 thi ewyaebkaemchchin A theory of interactive computation The main web source on this new subject duephim aekikhComputability logic Interactive computation Important publications in computability Open problems in computability Calculation ekhathungcak https th wikipedia org w index php title thvsdikarkhanwn amp oldid 9644640, wikipedia, วิกิ หนังสือ, หนังสือ, ห้องสมุด,