@inbook{7c658f35793f4078b91dc47eeee0f9b7,
title = "Uncomputabilities, Games, Axioms, Proofs and Artificial Intelligence",
abstract = "The prevalence of Undecidabilities, Incompleteness and Uncomputabilities in formal systems do not make it easy to devise policies, especially proving their existence, even in finite problem spaces. The interplay between the finite and infinite, between the logically formal and the intuitively sensible, is difficult to disentangle. This is especially evident in computable and uncomputable games. In this paper these games and some foundational questions of a mathematical and logical nature are also explored.",
keywords = "Arithmetic games, Busy Beaver games, Goodstein sequence, Growth of functions, Hercules-Hydra game, Paris-Harrington theorem",
author = "Velupillai, \{K. Vela\}",
note = "Publisher Copyright: {\textcopyright} 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.",
year = "2023",
doi = "10.1007/978-3-031-15294-8\_2",
language = "English",
series = "Understanding Complex Systems",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "13--26",
booktitle = "Understanding Complex Systems",
}