# PIOS Virtual Machine and Code

**Raul Deluth Miller**
rockwell@nova.umd.edu

*Thu, 27 Oct 1994 22:40:17 -0400*

Signed numbers?
1s or 2s complement?
Arithmetic overflow?
How to manage bit maps?
Big endian or Little endian? Or we try and hide distinction?
How to implement a queue? [does it get the same sorts of monitoring
as a stack?]
How efficient will this "operating system" be at emulating itself?
Raul D. Miller n =: p*q NB. 9<##:##:n [.large prime p, q
<rockwell@nova.umd.edu> y =: n&|&(*&x)^:e 1 NB. -.1 e.e e.&factors<:p,q [.e<n
NB. public e, n, y
x -: n&|&(*&y)^:d 1 NB. 1=(d*e)+.p*&<:q