Forum:ITTM cryptography

Call a function \(F: \mathbb{R}^i \mapsto \mathbb{R}^j\) ITTM-computable iff there is an ITTM \(T\) such that, for every \(i\)-tuple of reals \(X\), \(T\) halts with \(F(X)\) on the tape when \(X\) is given on the initial tape.

(in progress)