How to improve performance of a Cellular Automaton algorithm built in Java given that it operates only on 1s and 0s?

Question

I started from the premise that the most atomic, the smallest addressable piece on the venerable x86 PC is a byte. However, this algorithm (cellular automaton)