How would it be possible to translate the following statement
"Factoring natural numbers is hard but multiplying them is easy"
into a meaningful mathematical statement?
Not asking for a proof, just for what it means mathematically for a problem to be hard or easy.
Asymptotical approach doesn't work because the number of available bits in the universe for computation is a very small finite number.
Is it even possible?