Current architecture for microprogrammable machines vary widely. In order to avoid the applicability of the testing technique to a particular machine example, hardware, microware and microprograms are represented in a general fashion. This representation will account for a composite of features common to a large variety of contemporary machines. Such a general description seems to be absolutely...

In the s Bennett introduced computational depth as a formal measure of the amount of computational history that is evident in an object s structure In particular Bennett identi ed the classes of weakly deep and strongly deep sequences and showed that the halting problem is strongly deep Juedes Lath rop and Lutz subsequently extended this result by de ning the class of weakly useful sequences an...

Assuming that k and Pk does not have p measure it is shown that BP k P k This implies that the following conditions hold if P does not have p measure i AM co AM is low for P Thus BPP and the graph isomor phism problem are low for P ii If P PH then NP does not have polynomial size circuits This research was supported in part by National Science Foundation Grant CCR with matching funds from Rockw...

introduction: since discovery of high frequency waves, their biological effects have been in great attention. increased male fertility problems proposed their possible relation to use of microwaves. testes are of very active body tissues, which can be affected by these waves. age of exposure may also be an important factor. methods: this study was carried out to evaluated testosterone level in ...

This paper investigates the notion of resource bounded genericity developed by Ambos Spies Fleischhack and Huwig Ambos Spies Neis and Terwijn have recently shown that every language that is t n random over the uniform probability measure is t n generic It is shown here that in fact every language that is t n random over any strongly positive t n computable probability measure is t n generic Rou...

A computable complexity measure analogous to computational depth is developed using the Lempel-Ziv compression algorithm. This complexity measure, which we call compression depth, is then applied to the computational output of cellular automata. We nd that compression depth captures the complexity found in Wolfram Class III celluar automata, and is in good agreement with his classi cation schem...

A computable complexity measure analogous to computational depth is developed using the Lempel-Ziv compression algorithm. This complexity measure, which we call compression depth, is then applied to the computational output of cellular automata. We nd that compression depth captures the complexity found in Wolfram Class III celluar automata, and is in good agreement with his classi cation schem...