Theoretical investigations on the energy requirements of computation under limited resources
Loading...
Date
2023
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Thesis (M.S.) - Bogazici University. Institute for Graduate Studies in Science and Engineering, 2023.
Abstract
Computational complexity theory investigates the minimum amount of resources needed to perform a computation, and time and space complexity are the most popular of such measures. Landauer has shown that energy, just like time and space, is a resource, and quantified the amount of energy needed and when. We use Landauer's findings to naturally formulate the energy complexity of deterministic finite automata and machines with a single access to their input, and investigate it through the lens of computational complexity theory.