Holographic uncomplexity in the hyperscaling violating backgrounds

Abstract

In this paper, using complexity equals action proposal, we investigate holographic complexity for hyperscaling violating theories on different subregions of space-time enclosed by the null boundaries. By recalling the computation of on-shell action for certain subregions of the intersection between the Wheeler DeWitt patch, as well as, the future interior of a two-sided black brane, we are interested in computing uncomplexity in the hyperscaling violating theories. We show that the dynamical exponent plays a crucial rule in computing the rate of complexification. However, at the late time, the rate of the complexity growth is independent of the hyperscaling parameters. Moreover, we compute holographic uncomplexity in hyperscaling violating backgrounds and show when a black hole is formed, uncomplexity is the total space-time volume which is accessible to an observer who decides to pass over the horizon. Therefore, uncomplexity could be considered as a resource which indicates the computational power of a system. In fact, it can extract and analyze the useful information from the system.