THEORY OF EVERYTHING as  a r t i f i c i al   i n t e l l i g e n c e

By Henryk Szubinski

ON artificial intelligence OPERATIONS MADE IN THE 4 TH DIMENSION:as operators in 4 force field a.i units

operator 1

A relational database matches data using common characteristics found within the data

operator 2

set. The resulting groups of data are organized and are much easier for people to understand.

operator 3

For example, a data set containing all the real-estate transactions in a town can be grouped

operator 4

by the year the transaction occurred; or it can be grouped by the sale price of the

operator 5

transaction; or it can be grouped by the buyer’s last name; and so on.

operator 6

Such a grouping uses the relational model (a technical term for this is schema). Hence, such

operator 7

a database is called a “relational database.”

operator 8

operations in 4 force field a.i units

The software used to do this grouping is called a relational database management system.

operators in 4 dimensional a.i units

The term “relational database” often refers to this type of software.

Relational databases are currently the predominant choice in storing financial records, manufacturing and logistical information, personnel data and much more.

because there are theories about everything = x

It does not matter what is greater than everything=x>e¨

where e = everything

As long as you use any variable known as anything :1=a

where a = anything

To make it astrophysics:

2x>e squared / a

the basic usage of the theorem that defines the definite value of a process caught within a force field and the data based reference of the basic value as a force field (f.e) = 2x

The data on the inverted force field >that the altered vector =-2x

as a type value interactive value of the combined 2x+2x = e

as everything in the process of making it a volumetrical field value based on 2 dimensional constructs = e squared..

The value involvance of the divisive value in the altered and inverted volume value has a certain quant volume in relation to its area as:

Volume /a=Area

where a = anything:

the 3  formulations are then:

2x>e squared / a

Volume /a=Area

4x = e squared

2x. 4 x squ. = e squ.volume.area

the volume .area = a 4 th dimension in which the data comparative with 4 x = a x value

but also as a

8 x cubed= e squared ( 4 th dimension)

8 x to the 3 = everything squared in the 4 th dimension

where the 4 th dimension is the volumetrical usage of a greater volume increase

as :

4 force fields cubed = everything squared . in the 4 th dimension

THE THEORY OF EVERYTHING CAN BE APPLIED TO THE FORMATS OF RELATIONAL DATABASES:

4 force field a.i operators are hard at woork with 4 operators of a.i in the 4 th dimension

sector 1

Queries made against the relational database, and the derived relvars in the database are expressed in a relational calculus or a relational algebra. In his original relational algebra, Codd introduced eight relational operators in two groups of four operators each. The first four operators were based on the traditional mathematical set operations:

  • The union operator combines the tuples of two relations and removes all duplicate tuples from the result. The relational union operator is equivalent to the SQL UNION operator.
  • The intersection operator produces the set of tuples that two relations share in common. Intersection is implemented in SQL in the form of the INTERSECT operator.
  • The difference operator acts on two relations and produces the set of tuples from the first relation that do not exist in the second relation. Difference is implemented in SQL in the form of the EXCEPT or MINUS operator.
  • The cartesian product of two relations is a join that is not restricted by any criteria, resulting in every tuple of the first relation being matched with every tuple of the second relation. The cartesian product is implemented in SQL as the CROSS JOIN join operator.

sector 2

The remaining operators proposed by Codd involve special operations specific to relational databases:

  • The selection, or restriction, operation retrieves tuples from a relation, limiting the results to only those that meet a specific criteria, i.e. a subset in terms of set theory. The SQL equivalent of selection is the SELECT query statement with a WHERE clause.
  • The projection operation is essentially a selection operation in which duplicate tuples are removed from the result. The SQL GROUP BY clause, or the DISTINCT keyword implemented by some SQL dialects, can be used to remove duplicates from a result set.
  • The join operation defined for relational databases is often referred to as a natural join. In this type of join, two relations are connected by their common attributes. SQL’s approximation of a natural join is the INNER JOIN join operator.
  • The relational division operation is a slightly more complex operation, which involves essentially using the tuples of one relation (the dividend) to partition a second relation (the divisor). The relational division operator is effectively the opposite of the cartesian product operator (hence the name).

Other operators have been introduced or proposed since Codd’s introduction of the original eight including relational comparison operators and extensions that offer support for nesting and hierarchical data, among others.