Theoretical investigations on the energy requirements of computation under limited resources

dc.contributor	Graduate Program in Mathematics.
dc.contributor.advisor	Ecevit, Fatih.
dc.contributor.advisor	Say, Ahmet Celal Cem.
dc.contributor.author	Kıyak, Fırat.
dc.date.accessioned	2025-04-14T13:42:37Z
dc.date.available	2025-04-14T13:42:37Z
dc.date.issued	2023
dc.description.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.
dc.format.pages	x, 42 leaves
dc.identifier.other	Graduate Program in Mathematics. TKL 2023 U68 PhD (Thes PSY 2023 K37
dc.identifier.uri	https://hdl.handle.net/20.500.14908/21625
dc.publisher	Thesis (M.S.) - Bogazici University. Institute for Graduate Studies in Science and Engineering, 2023.
dc.subject.lcsh	Computational complexity.
dc.title	Theoretical investigations on the energy requirements of computation under limited resources

Files

Now showing 1 - 1 of 1