That&#x27;s a very strange interpretation of Rice&#x27;s theorem. Just because properties of computable functions are undecidable doesn&#x27;t mean they somehow &quot;can&#x27;t be described by mathematics&quot;. I&#x27;m also not sure why incompleteness is relevant here at all, unless you think describing something mathematically requires a complete formal system. In that case, we can&#x27;t &quot;describe&quot; arithmetic &quot;mathematically&quot;.