{"title":"Limitations to algorithm solvability: Galois methods and models of computation","authors":"C. Bajaj","doi":"10.1145/32439.32453","DOIUrl":null,"url":null,"abstract":"We use simple arguments from Galois theory to prove the impossibility of exact algorithms for problems under various models of computation. In particular we show that there exist applied computational problems for which there are no closed from solutions over models such as <italic>Q</italic>(+, -, *, /, √), <italic>Q</italic>(+, -, *, /, k√), and <italic>Q</italic>(+, -, *, /, k√, q(x)), where <italic>Q</italic> is the field of rationals and <italic>q</italic>(<italic>x</italic>)ε <italic>Q</italic>[<italic>x</italic>] are polynomials with non-solvable Galois groups.","PeriodicalId":314618,"journal":{"name":"Symposium on Symbolic and Algebraic Manipulation","volume":"87 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1986-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Symposium on Symbolic and Algebraic Manipulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/32439.32453","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
We use simple arguments from Galois theory to prove the impossibility of exact algorithms for problems under various models of computation. In particular we show that there exist applied computational problems for which there are no closed from solutions over models such as Q(+, -, *, /, √), Q(+, -, *, /, k√), and Q(+, -, *, /, k√, q(x)), where Q is the field of rationals and q(x)ε Q[x] are polynomials with non-solvable Galois groups.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
