Complexity and mission computability of adaptive computing systems

Venkat R Dasari, Mee Seong Im and Billy Geerhart

The Journal of Defense Modeling and Simulation, 2022, vol. 19, issue 1, 5-11

Abstract: There is a subset of computational problems that existing algorithms may not complete due to a lack of adequate computational resources on tactical edge computing platforms. Although this subset is computable in polynomial time, many polynomial problems are not computable in mission time. Here, we define a subclass of deterministic polynomial time complexity called mission class, wherein the computations must complete in mission time. By focusing on this subclass of languages in the context of successful military applications, we discuss their computational and network constraints. We investigate feasible (non)linear models that will minimize energy and maximize memory, efficiency, and computational power, and also provide an approximate solution obtained within a pre-determined length of computation time using limited resources so that an optimal solution to a language could be determined.

Keywords: Computability; P versus NP problems; strategic solvability; mission readiness; optimization; computational constraints; heterogeneous computational platform (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1177/1548512919869567 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:joudef:v:19:y:2022:i:1:p:5-11

DOI: 10.1177/1548512919869567

Access Statistics for this article

More articles in The Journal of Defense Modeling and Simulation
Bibliographic data for series maintained by SAGE Publications ().