My favorite math paper is "Is 10^10^10 a Finite Number?" by David van Dantzig. It lies more on the side of philosophy, so many can understand it easily. I first learned about it many years ago from Van Bendegem's list of strict finitism papers, and I would recommend that list for anyone interested in learning more about strict finitism.

For my personal opinion, strict finitism provides a richer field of study than potential infinitism or actual infinitism. Compare this to Errett Bishop's constructive analysis that requires the calculation of bounds to real numbers, instead of classical analysis only requiring that a real number exists. Much more difficult, though more precise.

I found "On Feasible Numbers" by Vladimir Sazonov to have application for computers. In a feasible mathematics, a large number fails to exist (say, 2^512), but a proof of contradiction must exceed such a large size (perhaps larger than the universe). Likewise, we have unix time that tries to count forever, so we should pick a storage size so large that counting exceeds the heat death of the universe. 10^100 years worth of Planck seconds fits in 501 bits, so round that to 512 bits. 512 bits of time ought to be enough for anybody :)

https://jeanpaulvanbendegem.be/home/papers/strict-finitism/