Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is Non-Deterministic Polynomial-Time Hard

Encyclopedia of Data Science and Machine Learning
A complexity class in theoretical computer science that includes all decision problems where you can efficiently verify the answer.
Published in Chapter:
Evolving From Predictive to Liquid Maintenance in Postmodern Industry
Manuel Lozano Rodriguez (American University of Sovereign Nations, Spain) and Carlos E. Torres (Power-MI, USA)
Copyright: © 2023 |Pages: 17
DOI: 10.4018/978-1-7998-9220-5.ch130
Abstract
PdM is unready to face the near-future incoming challenges since it is anchored in an obsolete paradigm alien to the incoming cyber-physical reality and unfit for unbelievable data density. In addition to this, PdM is wormed by philosophical hiddenness around time and taxonomies abuse; it is not the sound subdiscipline it appears to be. So, we are doomed to dialogue and get along with AIs if we want to break our human predictiveness ceiling glass and keep PdM improving. In this article, the authors explain not only the turn of the tide but how to flow towards a non-essentialist PdM paradigm.
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR