NLNN

1024 combinations and one of a double output

Description

The inputs in this program are 10.
Each input is 0 or 1.
Are 2^10 possible combinations.
First input is the most important input.
It is the one of a double output.
If its value is zero then the way is static and the output is a time of 1020.
If its value is one then the way is dynamic and the output is a zero time.
Also second input is important.
This input is function of the first input.
If its value is zero then the static way is a double inverter.
If its value is zero then the dynamic way is a single inverter.
If its value is one then the static way is a single inverter.
If its value is one then the dynamic way is a double inverter.
With 2 inputs there are 4 combinations: this program sector is the selection of one way of four possible ways.
With 2 inputs is defined the thickness of 3° dimension, and it is a verse.
The other 8 inputs are a sector of 256 combinations and this is the double dimension of the plane.
Selecting one of 256 combinations is obtained a point-plane and it is the zero selection of space.
The one of a double output and the one of 256 combinations are 2 values of the 3D selected (the inside).
The 3D is one way of verse and one point-plane.
With this strategy is been defined the basis 2 of movement and the first double input is possible.
The outside are 3 ways and 255 combinations of points-plane.
What is this program?
Is a demonstration-model of the instant movement with logic 2 values.
It take 2 vectors: the past time and the future time, builded with 10 numbers: 1 2 3 4 5 6 7 8 9 0.
The third vector are 19 sounds: a b c d e f g i l m n o p r s t u v z.
With the time symmetry is been builded the program strategy: the "m" is the half and it is a double zero.
The program importance is this.
Is possible to obtain one of a double output with only one input. I can choose the zero or the one.
In this case with 2 possible combinations there is in output one combination of two possibilities.
If there are 1024 combinations then there is in output one of two ways at the same of 2 possible combinations.
But!
Difference is:
in the first case I haven't defined the basis of movement and I have only one not selection
in the second case the basis is been defined and there are 1023 combinations in the outside verse
Utility of the program is to show a complete mechanism of time-symmetry.
Is applicable like strategy of control in more and more applications.
Is a simulation of a bio-perceptive decisional system.
If I write one in input then MATLAB write one and if I write zero It write zero.
Is necessary the existenz of 2 values to obtain the MATLAB output.
Is an introductive proposal for the study of the parallel mechanism.
A double time is a plane of half and an emotive vector with 19 elements is the thickness of third dimension plane.

• MATLAB release: MATLAB 6.1 (R12.1)
• Other Files: NLNN.m, ; NLNN_password.txt

[PXlab]

 

[Hal 9000]

 

[PXlab]

where? I don't find it.

[Gavrilo Bozovic]

 

[Gavrilo Bozovic]

double-check lines 1-300. it's pretty obvious...

[Cris Luengo]

OK, so the first input sets M=1 or M=10. All the other inputs are ignored, since the arrays N and NN are identical. If M==1 then nn through zz are set to 1. If M==10 then nn through zz are set to 0. This leads to values for 'future' and 'past' of either 510 or 0. When you say that there are "2^10 possible combinations", do you mean 2?

This is so clever, I wish I could understand it.

[PXlab]

Hi Cris, read this:
1024 combinations
2 values: 0 & 1
10 input
--------
4 combinations
1° input --> static or dynamic
2° input --> single or double
-----------------------------
1020 combinations
the time in static way --> 3 space
the space in dynamic way --> 3 space
------------------------------------
512 combinations
of static way
of dynamic way
--------------
2^8 = 256
half static way
half dynamic way
----------------
example
input sequence: 01 11100100
output: static way --> time=1020 & space=4 of logic 2 values and 2 inputs --> 3 space & 1020 time
In the input combination there are 2 sectors:
01
11100100
The first sector is ONE of 4 combinations.
The second sector is ONE of 256 combinations.
The total combination has 10 values and it is ONE of 1024 combinations.
In the first case there are 3 out-combinations
In the second case there are 255 out-combinations.
With union there are 1023 out-combinations.
The 258 combinations of 2 sectors are equal at 1023 combinations.
The double is the single.
Difference:
1023 - 258 = 765
Is obtained the inverse unity: 1-2=-1
Triple code 8 bit:
256 * 3 = 768
Is obtained the triple unity: 1*3=3
Conclusion:
768 - 765 = 3
3 + 1 = 4
The input combination is ONE ad it has 10 bit: 360-341=19
Where: 341=1023/3
The first sector is builded with 2 inputs of time.
The second sector is builded with 8 inputs of space where 4 input are the past time and 4 input are the future time.
The 2 inputs of time are the present instant, instant with the input combination.
The 4 inputs of half space are the past.
The 4 inputs of half space are the future.
The unity of time is double, the present instant is double.
The unity of half space is quadruple and in this way the unity of space/4 is double.
The unity of the space/4 is coincident with the double present instant.
The access code is determinated.
In the space and in the time.
The spacetime is been defined.
------------------------------
single = double --> n = nn --> input = output --> 1 = 2
% m = 0 & nn = 0 --> M = 1 & nn = 1
% m = 0 & nn = 1 --> M = 1 & nn = 1
% m = 1 & nn = 0 --> M = 10 & nn = 0
% m = 1 & nn = 1 --> M = 10 & nn = 0
is this
% input at zero & output at zero --> M = nn
% input at zero & output at one --> M = nn
% input at one & output at zero --> M = nn
% input at one & output at one --> M = nn
and it is the same of this
% m = 0 & n = 0 --> M = 1 & nn = 1
% m = 0 & n = 1 --> M = 1 & nn = 1
% m = 1 & n = 0 --> M = 10 & nn = 0
% m = 1 & n = 1 --> M = 10 & nn = 0
is this
% input at zero & input at zero --> M = nn
% input at zero & input at one --> M = nn
% input at one & input at zero --> M = nn
% input at one & input at one --> M = nn
-------------------------------------------------
1 = 1
input m --> output M
input = output --> m = M
------------------------
1 = 2
input n --> output nn
input = output --> n = nn
------------------------------
I'll submit a txt file in the future
Regards

[V. Poor]

Poor.

[pitta]

 

[alain boyer]

 

[Jveer]

 

[C]

 

[James]

 

[Ripley]

 

[Bishop]

 

[newt]

 

[Hudson]