Kiliç,H.Computer Engineering2024-07-052024-07-0520050780392396978-078039239-710.1109/SIU.2005.15676142-s2.0-33846606127https://doi.org/10.1109/SIU.2005.1567614https://hdl.handle.net/20.500.14411/3531In this paper, the predictability of power consumption of digital computing systems is investigated by using the abstract Turing machine model which is known to be a universal computer. An upper bound for power consumption of such machine model is defined. Also, a polynomial-time algorithm that can automatically produce a two-tape Turing machine which can record power consumption of an arbitrarily given standart Turing machine, is developed. ©2005 IEEE.trinfo:eu-repo/semantics/closedAccess[No Keyword Available]Conference Object200541440