Abstract
The Traveling Salesman Problem (TSP) was first formulated in 1930 and is one of the most studied problems in optimization. If the optimal solution to the TSP can be found in polynomial time, it would then follow that every NP-hard problem could be solved in polynomial time, proving P = NP. It will be shown that our algorithm finds P~NP with scale. Using a \( \delta - \varepsilon \) proof, it is straightforward to show that as the number of cities goes to infinity, P goes to NP (i.e., \( \delta > 0 \)). This was demonstrated using a quadratic number of parallel processors because that speedup, by definition, is polynomial. A fastest parallel algorithm is defined. Six distinct 3-D charts of empirical results are supplied. For example, using an arbitrary run of 5,000 cities, we obtained a tour within 0.00001063 percent of the optimal using 4,166,667 virtual processors (Intel Xenon E5-1603 @ 2.8 GHz). To save the calculated extra 209 miles would take a quantum computer, the fastest possible computer, over (5,000!/(2**4,978 * 22!)) * 267,782 centuries. Clearly, the automated acquisition of heuristics and the associated P~NP solutions are an important problem warranting attention. Machine learning through self-randomization is demonstrated in the solution of the TSP. It is also shown, in the small using property lists, for an inductive logic of abduction. Finally, it is argued that self-randomizing knowledge bases will lead to the creation of a synthetic intelligence, which enables cyber-secure software automation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Rubin, S.H.: Randomization for Cyber Defense, Patent Disclosure, NC 103845, 28 October 2015
Rubin, S.H.: On randomization and discovery. Inf. Sci. 177(1), 170–191 (2007)
Rubin, S.H., et al.: On heuristic randomization and reuse as an enabler of domain transference. In: Proceedings of the 2015 IEEE International Conference on Information Reuse and Integration (IRI), San Francisco, CA, 13–15 August 2015, pp. 411–418 (2015)
Amarel, S.: On representations of problems of reasoning about actions. Mach. Intell. 3, 131–171 (1968)
Rubin, S.H., Murthy, S.N.J., Smith, M.H., Trajkovic, L.: KASER: knowledge amplification by structured expert randomization. IEEE Trans. Syst. Man Cybern. Part B Cybern. 34(6), 2317–2329 (2004)
Mitchell, T.M., Carbonell, J.G., Michalski, R.S. (eds.): Machine Learning: A Guide to Current Research. Springer-Verlag Inc., New York (1986)
Kfoury, A.J., Moll, R.N., Arbib, M.A.: A Programming Approach to Computability. Springer, New York (1982)
Uspenskii, V.A.: Gödel’s Incompleteness Theorem, Translated from Russian. Ves Mir Publishers, Moscow (1987)
Rubin, S.H., Tebibel, T.-B.: NNCS: randomization and informed search for novel naval cyber strategies. In: Abielmona, R., et al. (eds.) Recent Advances in Computational Intelligence in Defense and Security, Studies in Computational Intelligence, vol. 621, pp. 193–223. Springer 2016
Minton, S.: Learning Search Control Knowledge: An Explanation Based Approach. Kluwer International Series in Engineering and Computer Science, New York (1988)
Biermann, A.W.: Automatic programming: a tutorial on formal methodologies. J. Symbolic Comput. 1(2), 119–142 (1985)
Acknowledgements
Stuart would like to acknowledge the assistance of Professor Thouraya Tebibel and student Yasmin Hoadjli, for their work in independently verifying the results reported by this paper. Stuart would like to extend special thanks to Michael Leyton, Rutgers Department of Mathematics, for reviewing his “tremendously exciting” Theory of Randomization [2] and to the kind genius, Sukarno Mertoguno for applicative discussions on cybersecurity. Stuart would also like to extend his thanks to the Office of Naval Research (ONR) for providing financial backing for this research with the support of Ken Simonsen. This work was produced by a U.S. government employee as part of his official duties and is not subject to copyright. It is approved for public release with an unlimited distribution.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Rubin, S.H., Bouabana-Tebibel, T., Grefe, W.K. (2018). On the Tractable Acquisition of Heuristics for Software Synthesis Demonstrating that P~NP. In: Rubin, S., Bouabana-Tebibel, T. (eds) Quality Software Through Reuse and Integration. FMI IRI 2016 2016 2016. Advances in Intelligent Systems and Computing, vol 561. Springer, Cham. https://doi.org/10.1007/978-3-319-56157-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-56157-8_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-56156-1
Online ISBN: 978-3-319-56157-8
eBook Packages: EngineeringEngineering (R0)