On surface, these seem two completely different class of problems. One class represent statements which can't be proved or disproved in an axiomatic theory. For example
One can write down a concrete polynomial P∈Z[x1,...x9] such that the statement "there are integers m1,...,m9 with P(m1,...,m9)=0" can neither be proven nor disproven in ZFC
Other class represent problems which can't be computed within fixed time. For example
The mortal matrix problem: determining, given a finite set of n × n matrices with integer entries, whether they can be multiplied in some order, possibly with repetition, to yield the zero matrix.
Is there any definite relation(with Curry-Howard isomorphism) between them, like one class being subset of other or both being the same