User blog comment:P進大好きbot/Relation between an OCF and an Ordinal Notation/@comment-30754445-20180810102658/@comment-35470197-20180812013943

> Can an actual physical computer do this in practice? Or does it have to be one of those ideal computers with near-infinite memory and near-infinite speed?

I think that an actual computer can compute the smallest term, i.e. the term corresponding to \(0\), as I conjectured that it corresponds to \(623\) in my ordinal notation.

The second ordinal term might be hard to compute. However, since I can partially compute a candidate of the second ordinal term as in my blog post, it might be possible if the computer has a good proof-assistant algorythm.

For terms beyond \(\varepsilon_0\), it would be hard to expect that an actual computer can compute them.