Speaker
Andrew Rolph
Description
In this talk, I will introduce holographic proposals for computational cost. If complexity is the length of the shortest path between two states, then cost is the length of a general, not-necessarily-shortest path. To highlight the differences from the holographic state complexity programme: (1) the boundary dual is cost, the "off-shell" version of complexity, (2) we consider all functions on all bulk subregions of any co-dimension (which satisfy the physical properties of cost), and (3) the proposals are by construction UV-finite. Lastly, I will explain how the path integrals, which we are proposing the cost of, fit within the framework of holographic $T\bar T$.
