Modelling the global war in the case if an efficient NP-complete algorithm is published

Lemme model what happens if somebody finds an efficient NP-complete algorithm. In layman terms an efficient NP-complete algorithm is: an algorithm that reaches any given decision accomplishment if what “to accomplish” is exactly (mathematically) described and is accomplishable (e.g. accordingly laws of physics). [That’s is oversimplified and inexact.] So, the first thing is that somebody…… Continue reading Modelling the global war in the case if an efficient NP-complete algorithm is published

Algebraic Theory of General Topology and Discontinuous Analysis book

An earlier version of this work was published by scientific publisher INFRA-M. Introduced several new axiomatic systems not less general than group theory and discontinuous analysis. In this work I introduce and study in details the concepts of funcoids which generalize proximity spaces and reloids which generalize uniform spaces, and generalizations thereof. The concept of…… Continue reading Algebraic Theory of General Topology and Discontinuous Analysis book