[bsedlm]

counter example.

consider that instead of punching out the holes, you added an ink blot, the ink is somehow reflective and thus is read by the machine (or whatever).

as the ink has a weight it now weighs more than when you started. Information has regular mass.

hence some prior assumption is mistaken and we could now prove something by contradiction.

now then, somebody please tell me if a proof by contradiction holds in constructive logic.

[drdeca]

Showing that X implies a contradiction is showing not X in intuitionistic/constructive logic, yes. However, you can’t show X by assuming not X and reaching a contradiction. By doing so you would only show not(not(X))

[rolandog]

Agreed; furthermore, your example is analogous to the classical way to answer a test by filling in the answer-sheet's circles with graphite pencils.