Patterns in inputs (Phi Style

)

Phi style is inverse to the normal binary distribution. This is, in normal style, less significant
bit is in the right side. In phi style le less significant bit is in the left.

How 0s and 1s are distributed in input repertoire.

To find patters in distributions in inputs I focus in 0 for two simple reasons
1) Because in a up-down reviewing of columns, 0s appear always first
2) Because 1s’ distribution is the mirror of 0s’ distribution.

Distribution of digits follows two single rules in up-down order, for a column:

1) 0s appear in even locations, then 1s appear in odd locations
2) apparitions of a bit (0 or 1) appear in repetitions equivalent to the power of the
node that head a column.

See Figure 1.

Fig. 1. Distribution of 0s and 1s in inputs repertoire

this is. 1s in odd places. Then in order to find an specific output in repertoire output 1) I identify inputs of a node 2) I identify the logic operation that this node performs 3) For each and all of its inputs to this node I ask: where this input = 0? Then. if this node is an OR gate. How to find a specific pattern in outputs analysing inputs? Following the two rules mentioned before. Why this analysis is not the best option? Because It is equivalent to review completely all the inputs repertoire. I also know that AND gate results in 0 when any of its inputs = 0. for column 4. All of them appear repetitions equivalent to a power that is defined in the order of columns (nodes). Then. For large networks it is not a good idea. . and. the node 4. for all locations where exists a 1 the output = 1.As is possible to observe in Fig. Then power = node – 1. if I’m looking for 0s I need to follow even partitions and odd in 1s case. its power is equal to 3 since the order of columns. this is. 1. represented by column 4. I know that bits appear in repetitions equal to 2^power. it is easy to know positions where 0s or 1s appear in an input repertoire. I know what OR gate results in a 1 when any of its inputs = 1. For instance. where power = node -1. 0s are always in even places.