The emptiness problem is undecidable for LBAs. (LBA=Linear bounder automation)A LBA is simply a TM that never moves out of the first |x| (the input portion) cells for any input word x. Now, I define a restricted form of LBA, called jump-LBA. A jump-LBA M is a LBA such that, once it writes on a cell, it must jump back to the beginning of the tape. Show that the emptiness problem for jump-LBAs is undecidable.