{"title":"np困难任务:定理的自动证明和图灵机","authors":"V. Martyanov","doi":"10.17150/2411-6262.2021.12(4).11","DOIUrl":null,"url":null,"abstract":"It is offered to use for solving NP-complete (difficult) tasks a modification of methods for satisfying the constraint (CS) by including automatic proof of theorems (APT), and programming in constraints — generation of Turing's machine (TM). Currently, CS uses AP in a truncated form (logical programming), and it is suggested using the method of invariant transformations (MIT), which is a full-fledged APT. In addition, it is offered to use CS methods to generate TM solving NP-difficult tasks recorded on the TM tape, which is an extension of programming capabilities in constraints.","PeriodicalId":8692,"journal":{"name":"Baikal Research Journal","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"NP-Difficult Tasks: Automatic Proof of Theorems and Turings Machine\",\"authors\":\"V. Martyanov\",\"doi\":\"10.17150/2411-6262.2021.12(4).11\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is offered to use for solving NP-complete (difficult) tasks a modification of methods for satisfying the constraint (CS) by including automatic proof of theorems (APT), and programming in constraints — generation of Turing's machine (TM). Currently, CS uses AP in a truncated form (logical programming), and it is suggested using the method of invariant transformations (MIT), which is a full-fledged APT. In addition, it is offered to use CS methods to generate TM solving NP-difficult tasks recorded on the TM tape, which is an extension of programming capabilities in constraints.\",\"PeriodicalId\":8692,\"journal\":{\"name\":\"Baikal Research Journal\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Baikal Research Journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.17150/2411-6262.2021.12(4).11\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Baikal Research Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17150/2411-6262.2021.12(4).11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
NP-Difficult Tasks: Automatic Proof of Theorems and Turings Machine
It is offered to use for solving NP-complete (difficult) tasks a modification of methods for satisfying the constraint (CS) by including automatic proof of theorems (APT), and programming in constraints — generation of Turing's machine (TM). Currently, CS uses AP in a truncated form (logical programming), and it is suggested using the method of invariant transformations (MIT), which is a full-fledged APT. In addition, it is offered to use CS methods to generate TM solving NP-difficult tasks recorded on the TM tape, which is an extension of programming capabilities in constraints.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
