Elaborate on the significance of Gödel's First and Second Incompleteness Theorems for formal axiomatic systems. Specifically, discuss how these theorems demonstrate the inherent limitations of consistent systems capable of arithmetic. Further, analyze the theoretical implications for computational theory and the philosophical debates regarding the possibility of creating a 'complete' artificial general intelligence.