Moutaz Fakhry, Yuri Granik, et al.
SPIE Photomask Technology + EUV Lithography 2011
A new formal model of register machines is described. Registers contain bit vectorswhich are manipulated using bitwise Boolean operations and shifts. Our main results relate the language recognition power of such vector machines to that of Turing machines. A class of vector machines is exhibited for which time on a vector machine supplies, to within a polynomial, just as much power as space on a Turing machine. Moreover, this is true regardless of whether the machines are deterministic or non-deterministic. © 1976 Academic Press, Inc.
Moutaz Fakhry, Yuri Granik, et al.
SPIE Photomask Technology + EUV Lithography 2011
Minghong Fang, Zifan Zhang, et al.
CCS 2024
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007