Practically? No.
Also from Minksy's work: A million binary states, results in 2 ^ 1,000,000 possible states that need to be examined.
So, a 512kb program, needs an examination of about 4,000,000 states. However, that'd be a bare-metal program. Any examination would also need to include hosting code, such as the Operating System, and drivers being interacted with, and so on.
It quickly blows out of proportion, and begins to become highly impractical, in similar ways to cryptographic algorithms.
More than that, my examples are undercutting the scale - they're assuming program states and assembled programs are equivalent, but I don't think they are.
> even if such a machine were to operate at the frequencies of cosmic rays, the aeons of galactic evolution would be as nothing compared to the time of a journey through such a cycle ...the magnitudes involved should lead one to suspect that theorems and arguments based chiefly on the mere finiteness the state diagram may not carry a great deal of significance. [Minsky, 1967]
Minsky's impression seems to be that this is the bare minimum amount of work required to solve the halting problem for a specific case.
With finite storage, every program becomes a finite-state machine; and to "solve" the halting problem, one only needs to use the usual cycle-finding algorithms.