How to prove (un)decidability
The problem is decidable. You can enumerate the (finitely many) programs that use at most $b$ bytes.
For each such candidate program $P$, you can check whether $P$ is valid program (for any reasonable representation) and execute it for up to $t$ time steps. Eventually you either find a program that prints $s$ (and accept) or you run out of programs (and reject).