Prime numbers are also important in computability theory. Godel number, for example, uses prime number to assign each symbol and laid the foundation for Godel's

Prime numbers are also important in computability theory. Godel number, for example, uses prime number to assign each symbol and laid the foundation for Godel's incompleteness theorem