bijective

Then, by a straightforward, computable, bijective numerical coding, this idealized FORTRAN determines an EN. (Note: In this FORTRAN example, we could have omitted restrictions on I/O and instead used a computable, bijective, numerical coding for inputs and outputs to get another EN determined by FORTRAN.)

Proving the conjecture is equivalent to constructing a PCP that reads 2 symbols and accepts iff these symbols satisfy a bijective constraint.