NP-Difficult Tasks: Automatic Proof of Theorems and Turings Machine

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.