Exhibition of selfapproximation algorithm and program., Model. 
Exhibition of selfapproximation algorithm and program., Model. 
omegapoint 
Dec 22, 2010, 07:50 AM
Post
#1

Newbie Group: Basic Member Posts: 24 Joined: Sep 14, 2010 Member No.: 33085 
The aim of this exhibition is towards the creation of a choice mechanism for artificial intelligence and a self awareness system using a model that can be related to an expanding universe which describes a mathematical proof that postulate that; at every chosen number there exist a turning point zero.
It is a unified theory that unites all numbers and can aid teleportation later in the future. This further tells us that all numbers can evolved out of nothing. The imperfect rounding up of some certain decimal numbers in the array of numbers that includes decimals enable us to see that a self awareness system is possible for the fact that the above said model has the power to approximate and truncate zero after limiting the number of decimal places by itself and this can bring us to a self awareness system. Here is the link: Global news via; www.gliict.com 
omegapoint 
Jan 06, 2011, 11:18 PM
Post
#2

Newbie Group: Basic Member Posts: 24 Joined: Sep 14, 2010 Member No.: 33085 
IMAGES of the sequence via Global news at www.gliict.com
Assuming half of a number = y Given the equation: (y  x) + (0.5 × n) = b (y + x) – (0.5 × n) = b Assuming y = 6.5 where x and n equals 8 initially. 8+0=8 and 8+0=8 or (2×4=8) difference between 8 and 8 = 0 (6.5  8) + (0.5 × 8) = 10.5 (6.5+ 8) – (0.5 × 8) = 10.5 8+1=9 and 8+2=10 or (2×5=10) difference between 10 and 9 = 1 (6.5  9) + (0.5 × 10) = 10.5 (6.5+ 9) – (0.5 × 10) = 10.5 8+2=10 and 8+4=12 or (2×6=12) difference between 12 and 10 = 2 (6.5  10) + (0.5 × 12) = 10.5 (6.5 + 10) – (0.5 × 12) = 10.5 8+3=11 and 8+6=14 or (2×7=14) difference between 14 and 11 = 3 (6.5  11) + (0.5 × 14) = 10.5 (6.5+ 11) – (0.5 × 14) = 10.5 8+4=12 and 8+8=16 or (2×8=16) difference between 16 and 12 = 4 (6.5  12) + (0.5 × 16) = 10.5 (6.5 + 12) – (0.5 × 16) = 10.5 … Therefore, this shows that there are infinite number of (x, n) pairs that would produce b. 
omegapoint 
Jan 06, 2011, 11:22 PM
Post
#3

Newbie Group: Basic Member Posts: 24 Joined: Sep 14, 2010 Member No.: 33085 
A CHALLENGE FOR ALL PROGRAMMER AND THEORIST!
The sequence via global news at www.gliict.com is a challenge for every programmer and theorist. What it postulates; At every chosen index number there lies a turning point zero designated as (0,0,0). That is if you assume an arithmetic growth mechanics, all numbers can be ``evolved''. No one had been able to replicates the sequence “exactly” or come out with the source code. No not one! 
LoFi Version  Time is now: 31st July 2014  07:32 AM 