staym@accessdata.com
Mon, 29 Mar 1999 18:41:38 -0700
Any ideas where to find papers on things like "the class of functions of
m boolean inputs to n boolean outputs computable in less than t steps of
a turing machine"?
-- Mike Stay Cryptographer / Programmer AccessData Corp. mailto:staym@accessdata.com
The following archive was created by hippie-mail 7.98617-22 on Sat Apr 10 1999 - 01:18:51