Such a machine has polynomially-many configurations, so log-space reductions are also polynomial-time reductions.
Sellisel masinal on polünoomiliselt palju paigutusi, nii et logi-ruumi vähendamised on ka polünoomilised-aja vähendused.