IL33006A - Data processing apparatus - Google Patents

Description

8»i%ii* «ns*s> χψηη Data processing apparatus JACQUES LOOTS SAWm This invention relates to data processing apparatus for the analysis of networks representing various possibilities of passing from certain states of one or several systems to other states, in the search for the existance of an optimum passage between two states, one initial the other final.

French Patent No. 1483778 discloses a method and device suitable for solving this type of problem in the case of a single network composed of a set of nodes connected by orientated links. If in this network the nodes correspond to points all representative, in a suitable geometric space, of states of a system and if the meshes or links correspond, with weightings which may possibly be different, to all the possible elementary trajectories around the various nodes, this method consists of: identifying a group of nodes representing a first population of points, called starting points, and another group of nodes representing a second population of points, called arrival points; emitting simultaneously, from all the nodes constituting the population of arrival, signals progressing step by step along the meshes or links of the network towards the intermediate nodes; normally preventing the reception of more than one of these step by step signals by these intermediate nodes; determining the starting node which is the first reached by one of these signals and then interrupting the progression of these; and finally setting up from this starting node determined in this way a connection terminating at the arrival node from which has started by signal which has been the first to reach the determined starting node.

This method accordingly permits the determination of the coupling from starting point to arrival point, corresponding to the optimum trajectory in the network considered, i.e. a trajectory including the minimum number of steps, using the convention that the number of steps necessary to move through a link is fixed by its weighting. In certain applications there is only one single starting point and one single arrival point.

Although the number of factors capable of intervening in the definition of the states of the system considered may be very high, the representative network being then defined in a geometrical space comprising a great number of dimensions, this method is not applicable to problems which are concerned with the utilisation of several networks which have to be made inter dependent for representing the possible or conceivable developments of several systems reacting on one another. In this type of problem the solution is represented by the existence of an optimum passage between an initial complex situation defined by the identification in each of the networks of a node called a starting point, and a final complex situation, defined by the identification in each of the networks of a node called target point; this passage should take into account not only internal constraints of each network, but also constraints between these networks.

The path between an initial complex situation and a final complex situation is carried out in a succession of steps called a transformation. Each step comprises, in at least one of the networks, the passage from a node to an adjacent node. The ensemble of the nodes reached at the end of a step constitutes an intermediate situation, he weighting of the order p of a mesh is equivalent to a sequence of p unit meshes or links.

Given a transforma ion, the passage from an intermediate situation to another cannot in general be carried out by-passage from a node to the following, in each of the networks simultaneously, by reason of the inter-dependence constraints among the networks. The existence of these inter-dependence constraints is expressed in effect by the associations of meshes (links) or nodes which incorporate for the transformation the obligation (or prohibition) of certain intermediate situations, or of the simultaneous passing through certain meshes or links belonging to different networks.

Thus, one can encounter associations of nodes and associations of links; these latter may themselves be divided for example int_ associations of links as a function of direction and associations of links as a function of their weight.

If the optimum passage between the initial situation and the final situation is defined as the- transformation whic includes the minimum number of steps, by reason of the constraints this optimum passage is not in general the combination of all the optimum trajectories determined independently in each network. This excludes therefore the repeated application of the above known method to each network. By way of example the problem set out above is met with in problems of the planning of tasks to be performed with a finite number of means, such as the organisation of raileay networks, telephone networks, and so on.

For solving this type of problem, the plain generalisation of the method defined above for its use in several networks with simultaneous progression of signals in these networks is impracticable. If each detwork is defined in a sub-space (the number of dimensions having little importance) , each of the networks may be considered as the projections in each of the sub-spaces of an imaginery network which would exist in a sub-space, which imaginery network represents the inter-dependeace of these networks and in which the initial situation and the final situation would each be represented by a node.

An optimum trajectory in this imaginery network between the initial complex situation and the final complex situation may project itself in a particular sub-space in the form of a trajectory including one or several loops. Such a trajectory is obviously not optimum between the starting point and the target point of the network considered, but it will be called optimum component trajectory in this network. It will be necessary to respect the trace to describe the optimum trajectory composed by the set of optimum component trajectories of the real networks in the course of the search.

In the method of searching for the optimum trajectory ig a single network, the possibility of extracting looped trajectories is eliminated by inhibiting the reception of more than one signal by an intermediate node in the course of the retrograde search represented by the progression of step by step signals between the arrival points and the starting points.

The necessity for admitting possible looped optimum component trajectories in the networks accordingly prevents the use of this method in the case of several inter-dependent networks and the reception of more than one signal by a node must be accepted.

If one carries out a retrograde search in each of the networks between the target point and the starting point, it is not possible to stop the retrograde progression when the starting point is reached in one of the networks only; it is necessary to wait until it is reached in all the networks simultaneously. At the moment when this search is stopped, it is then impossible to determine as previously in each network an immediate connection between the starting point and the arrival point: nothing enables distinction to be made between the optimum component trajectory and the other trajectories.

The aim of the present invention is to provide means by which a determination may be made of the optimum component trajectories in several inter-dependent networks between the starting points in these networks, the set of which constitutes an initial situation, and the target points, the set of which constitutes a final situation, overcoming the difficulty which has just been mentioned.

The present invention consists in data processing apparatus arranged to perform a method for the search for a j set of optimum component trajectories in a set of networks, which includes the steps of starting a retrograde step from each of the target points of the hetworks and, when all the starting points have been reached simultaneously by the search, there is identified and stored for each network, as belonging to the optimum component trajectory sought, the last node reached by the retrograde search before the starting point, said last node then being used as a fresh starting point for a further retrograde search from the same target point.

The invention further consists in data processing apparatus arranged to perform a method for the search, simultaneously in several networks, for a set of optimum component trajectories respecting constraints of inter-dependence of these networks, these trajectories connecting in each network a starting point node and a target point node, in which method : « a set of starting point nodes characterises an initial complex situation A; a set of target point nodes characterises a final complex situation Z; the transitition between the initial complex situation A and the final complex situation Z is carried out in a succession of steps constituting a transformation; each step comprises the passage from one node to an adjacent node in at least one of the networks; the set of nodes reached at the end of a step constitutes an intermediate complex situation; the optimum component trajectory of each network is defined as that trajectory which permits the transformation in the minimum number of steps; and at least one of the networks has several optimum component trajectories, called equivalent, in the case where there is more than one such transformation; wherein the method is carried out by performing a series of : retrograde investigations from the final situation Z towards the initial situation A in the following way: (i) starting from the target point z of the final situation Z. determining in each network predecessor nodes y which constitute intermediate situations from which the final situation Z is accessible in one step, this determination representing the first step of a retrogradi investigation; (ii) thenv starting from the nodes y constituting these intermediate situations Y^, determining, still in each network, the predjsjssor nodes x constituting intermediate situations X. from which the intermediate situations are accessible in one step, this determination representing the second step of the retrograde investigation; (iii) continuing thus step by step with the retrograde- investigation up to a step of order n which terminates in a number of intermediate situations among which there is an intermediate situation BQ accessible in one step from the initial situation A; (iv) registering the successor nodes b constituting the intermediate situation Bo as being each the end of a first elementary activity of the optimum component trajectory sought in each network; (v) proceeding to a further retrograde investigation from the final situation Z, taking as a new initial situation the situation BQ, for determining a situation CQ accessible in one step from e situation BQ and consisting of successor nodes c each of which is the end of a second elementary activity of the optimum component trajectory sought in each network; and (vi) carrying out further retrograde investigations step by step until the desired set of optimum component trajectories has been determined.

The method referred to above also applies to the case where there is in each network a population of starting points and a population of target points. An important feature of the method is the simultaneous nature of the retrograde investigation from each target point in all the networks. This investigation progresses in each network taking into account the inter-dependence constraints. As soon as there is reached simultaneously a set of nodes comprising a starting point in each network, the retrograde investigation is stopped and a step of the transformation is carried out from these starting points. This step defines in each network a fresh starting point for the following retrograde investigation which then develops in each network from all the target points and finishes at this single fresh starting point. In this way there is built up the optimum component trajectory which connects in each network the previously selected starting point with the first target point encountered.

The apparatus is arranged to process data relating to the various networks with their nodes and links, whether weighted or not, and data relating to the various associations defining the inter-dependence constraints of the networks.

Each network may be taken into account in the machine by means of a connection centre, comprising as many node elements as there are nodes in the network, and by means of a recording centre comprising as many link elements as there are links among the various nodes of this network. There will accordingly be as many connection centre/recording centre couples in the machine as there are networks to be taken into account.

The constraints may be taken into account in association centres comprising elements connected to the elements of the connection or recording centres of the various networks which their task is to join. For instance, an element of aaseciation of three nodes belonging to different networks will be connected to each of the corresponding node elements by a line called line of interrogation and a line called line of authorisation. This element is constituted by a logical gate which in reply to a signal on one of its interrogation lines will transmit a signal on the corresponding authorisation line only if a certain condition, of interest to the other two nodes, is satisfied; this condition may for instance be the presence or absence of simultaneous interrogations coming from these other elements; the existence of the signal of authorisation may also be subordinated to the existence of another condition such as the previous memorisation of the element, an information signal coming from adjacent elements, or the result of some other logical operation connected with this element.

The invention still further consists in data processing apparatus for carrying out a method for the simultaneous search in several networks for certain trajectories, called optimum component trajectories, respecting inter-dependence constraints of these networks, these trajectories connecting in each network a starting point node and a target point node, wherein the apparatus includes :- (A) for simulating each network :- (i) a connection centre comprising as many elements called node elements as there are nodes in the network; (ii) a recording centre comprising as many elements, called link elements, as there are links in the network; (iii) lines called OACI which connect each node element to all the link elements starting from this node ; (iv) lines called EACI which connect each node element to all the link elements of which this node is the end; (v) these lines are adapted to assume functions of interrogation (INT) if they carry signals issued from node elements towards link elements, or functions of authorisation (AUT) if they carry towards the node elements signals issued by a link element on which there has been coincidence of signals INT OACI and INT EACI; and (vi) lines called SORT ACT ensuring the outlet of information relating to the elementary activity accomplished in each network at each step; (B) for simulating the inter-dependence constraints of the networks :- centres of association comprising elements of association of node elements of different networks and/or of link elements of different networks to which elements they are connected by lines, called lines of interrogation if they carry signals to a centre of association and called lines of authorisation if they carry signals coming from a centre of association; (0) posting members for a target point node and a starting point node for each network; £D a centre of co-ordination of the step by step execution of various phases of the search, simultaneously in the centres materialising each network, this search comprising alternate phases .(? and ¾f succeeding each other until the node posted as target point is reached and in which :- (i) the first step of a retrograde investigation phas'7 /* starts by the transmission, from each node element posted as target point, a signal to the line INT EACI which departs from there and the systematic transmission of signals to all the lines INT OACI, the node elements which receive in return a signal of AUT OACI, after verification in the centres of association corresponding to possible predecessor nodes of the target points; (ii) the second step of the phase ■ develops in an identical manner from predecessor node elements as do the following steps; (iii) a logical end gate for detecting the step at the end of which the node elements posted as starting points in each network receives simultaneously a signal AUT OACI and then controlling the stopping of the phase ;" and (iv) the phase starts after the stopping of the phase ■* by the sending of a signal to the line INT OACI issued from the starting node element in each network, and by the sending of a signal to the lines INT SACI of the node elements reached during the last step of the retrograde investigation phase to terminate in the identification for each network, as the fresh starting node, of a successor node receiving the signal AUT EAC3T, the elimination of the identification as the starting node of the preceding element, and the ismie of a line SORT ACT in each network of informations relative to the activity thus accomplished, and (E) temporary memories 332 associated with the nodes for identifying the predecessors constituting intermediate situations reg&hed at the end of step ft and connected to the posting members of the target point nodes; memories BQ associated with starting point nodes for identifying the successors constituting the actual or present situation and connected to posting members of the starting point nodes; and buffer memories Bl.

Preferably, the recording centre comprises for each node element a link element of zero value as well as other arrangements which will be examined below, The apparatus defined above will hereinafter be described in greater detail by way of example with reference to the output of a combinatory active memory comprising matrix structures with at least two inputs and temporary memories of known construction enabling the representation of the developments of a system defined by several parameters capable in each case of taking a finite number of values, called situations, and of undergoing an equally finite number of variations, called actions, from each of these situations, The various possible states of the determined system are defined for each parameter by a plurality of situations; from each situation the parameter may undergo one or several variations or actions; these actions translate the possibility for the system of passing from a situation to another in accordance with this parameter. The various possible situations of the system and the various actions among the situations may accordingly be represented by a network comprising nodes/situations and links/actions.

Moreover, the networks associated with the various parameters are inter-dependent since the transition of this system from one state to another is translated in general by the passage from a situation to another in accordance with changes in several parameters simultaneously.

A given evolution of the system is constituted by the passage from an initial complex situation, defined by the set of the values of the parameters at an initial instant to a final complex situation defined by the set of the final values of the parameters ; this is accordingly a transformation.

If the transformations of a given system are recorded in an active memory in such a manner that the possible situations and actions of this system in accordance with each parameter are represented by a network, there may be applied to this active memory a method and a device for extraction of the type previously defined for the search of optimum component trajectories in several inter-dependent networks. Of course, at the same time as the situations and the actions, there will be recorded the associations which constitute the inter-dependence of the parameters.

The amplitude of a transformation is defined by the number of complex actions or number of steps necessary for connecting these two situations.

The optinun transformation will then be that which comprises the minimum number of steps.

A transformation of a system defined by n parameters may conveniently be represented in an associated n - dimensional space. In this space, a complex situation will be represented by a point and a complex action by a vector; a transformation will accordingly be represented by the connection of two points representative of complex situations by a chain of vectors representing the chain of complex actions*.

The active memory which will now be described has two functions : a function of store,ge of information relating to complex transformations in accordance with a process called "recording process". Thus, the apparatus will bo able to store a great number of complex transformations connecting in pairs initial situations to final situations. It will also be able to store a set of complex situations and to be endowed with certain possibilities of actions in this set, this case being able to be a limit case of the first form of storage ; a function of "extraction" which, from stored information, permits the supply of information on the realisation of complex transformations. In particular,it permits the determination to be made of how one can join two complex situations which had never previously been in the experience of the apparatus, by determining the transformation comprising the minimum number of steps necessary for this purpose.

It will be seen that the active memory, with its characteristic memory portion and its characteristic extraction system, permits the solution of complex problems such as the determination of strategies, i.e. sequences of successive decisions to be taken in the accomplishment of any task. Each stage of a strategy is accompanied by a fan of possible routes thus requiring a decision; the number of stages increasing and the possibilities of choice at each level multiplying. The total number of possible strategies, of which it is not known in advance whether each will be good or bad, thus increases in considerable proportions. At the present moment the problem, which is posed in a most crucial way in numerous activities, is to select a strategy which will at least be good and will if possible be thebest.

Traditional calculating and data processing machines approach this problem by examining successively all the possible combinations capable of constituting a solution.

This is obtained only at the expense of a considerable increase in the size of the memories of the machines and, as time progresses, machines quickly become of a considerable size, even prohibitive. Moreover, such systems are unsuited for the unforeseen introduction of fresh information during the course of processing and this is particularly so for real time operation.

The active memory described above, by virtue of the principles on which it is based, enables these problems of strategy to be approached more easily than with the traditional systems. The active memory works in a synthetic, experimental, evolutive and parallel manner, in contrast to most traditional systems w ich work in an analytical, numerical, set and sequential manner.

The active memory is synthetic to the extent that by the storage in a single memory element or in a small number of memory elements, it permits the association of a number of values, which number may be considerable, such as for instance, the co-ordinates of a point in an n-dimensional space.

It stores an "experimental behaviour". It possesses in fact memory elements the storage state of which brings about the transition from one value of a parameter to another. Accordingly, it enables the registration to be made of the transition of a particular set of parameter values to at least one other particular set of values of these parameters characteristic of a resultant state of a system.

The memory is active in the sense that the writing of a new behaviour may be carried out in the memory itself from the actual state of storage, and in that the interrogation of this memory, or extraction, is carried out also in the interior of this memory, taking into account its actual state of storage, which is capable of being modified in the course of extraction.

The active memory is synoptic, i.e. it works in parallel by simultaneous interrogation in all the possible circuits to take into account stored information.

TERMINOLOGY It is necessary to distinguish, terminologically those expressions used in connection with firstly the system or systems whose data one intends to store and process, secondly the associated geometrical representation, and thirdly the elements of the machine concerned with the representation of these data.

Network: A set of points, called nodes, connected by orientated segments called links.

Trajectory: A path through a network following the links between a node called the starting point and another node called the target point.

Elementary activity: A portion of a trajectory composed of an original node, an end node and the link which connects them.

Predecessor node: Given a node in a trajectory, its predecessor is the origin of the activity of which it constitutes the extremity.

Successor node: Given a trajectory between a starting point and a target point, the successor of the starting point is the extremity of the first activity of the trajectory and constitutes, when the system is found there, a new starting point for the trajectory in the direction of the target point.

Free link: By analogy with the free vector, two links have the same free link if they are carried by two equivalent vectors.

Node element: Element of the machine related to a node of the network.

Link element: Element of the machine related to a link of the network.

Complex situation: A set constituted by taking a node in each of a number of networks.

Transformation: Passage from an initial complex situatio s characterised by a set of starting point nodes, to a final complex situation, characterised by a set of target point nodes.

Step: A portion of a transformation comprising the transition from a node to an adjacent node in at least one of the networks.

Intermediate complex situation: The set of the nodes at the end of one step of a transformation.

Complex activity: A portion of a transformation constituted by one step and the two intermediate complex situations which it joins together.

Optimum component trajectory: If the networks are inter-dependent, there may exist in each network at least one optimum component trajectory defined as that which permits the transformation in a minimum number of steps.

Present complex situation: Intermediate complex situation of the system controlled by the extraction device.

Weighted node: Node on which the trajectory should rest for a number of steps equal to the weight of the node before passing to the following node* weighted link: link which necessitates, in order to be traversed by a trajectory, a number of steps equal to its weight. A link or a node having a weight p_ is equivalent for a trajectory to a sequence of £ links each having a weight equal to 1. The preceding definitions apply equally to the case of networks with weighted nodes of links.

A particularly frequent case in which a definition of the states and of the evolution of one or several systems causes inter-dependent networks to "be introduced, is the case where the states of this system are defined by a set of parameters. Each set of values of the parameters constitutes a complex situation; this complex situation is represented by a point in the as ociated space of a machine.

Each value of a parameter is called a situation, in contrast to the complex situation. Each variation of a parameter is called action, and complex action will be used to denote the simultaneous variation of a set of parameters. It is represented by a vector in the associated space of the machine.

A transformation consists of the transition of an initial complex situation to a final complex situation by a chain of complex actions. It is represented by a geometric transformation in the associated space.

The other preceding definitions of steps, elementary activity, complex activity and Intermediate complex situation remain unchanged. In the machine, instead of speaking of elements related to the nodes and to the free links, reference will be made to elements related to the situations and to the actions.

In the description which follows, the terms centres of association of situations (CAS) and centres of association of actions (CAA) have been reserved for the active memory, whereas the terms centres of association of nodes and and centres of association of free links apply more generally to all the machines operating the same extraction process.

The invention will now be described by way of example with reference to the accompanying drawings in which:- Figure 1 is a geometrical representation of a complex activity, Figure 2 is a geometrical representation of several complex activities having the same origin, Figure 3 is a diagram of the principal centres of an active memory with two parameters, Figure is a geometrical representation of various transformations written in an active memory, Figure 5 represents an active memory in which a complex activity is written in an apparent manner, Figure 6 illustrates the combinatory power of the active memory, Figure 7 is a logical diagram of an element of association of situations (EAS), Figure 8 is a logical diagram of a connecting element (EL), Figure 9 is a logical diagram of a recording element (EI), Figure 10 is a logical diagram of an element of association of actions (EAA) Figure 11 is a logical diagram of a general interconnection of the machine showing in particular the connections of the various centres to one another, Figures 11a, lib and 11c show in greater detail parts I, II and III separated by dot-dash lines in Figure 11, Figure 12 is a logical diagram of a circuit energized at the time INS 0?2, Figure 13 is a logical diagram of a circuit energized at the time T2, Figure 14 is a logical diagram of a circuit energized at the time , Figure 15 is a diagram of signals of the time^^ , Figure 16 is a diagram of the signals of the time ^ , without intervention of the hierarchy, Figure 1? is a diagram of the signals of the time ^ , with intervention of the hierarchy, Figure 18 shows the connection of a U gate of proximity of an element of CAS, Figure 19 is an illustration of the necessity of self maintenance, Figure 20 is a logical diagram of a multiple action gate PAM, Figure 21 is a diagram of the logical gate supplying to the co-ordination centre the information in accordance with which there is used zero, one or more than one complex action at the time ^ , Figure 22 is a logical diagram of the inter-actions priority circuit in each parameter, Figure 23 is a logical diagram of the inter-parameters hierarchy circuit, Figure 2 is a diagram of the EAGI connections in a recording centre providing a relooping for the parameter in question, Figure 25 is a diagram of a network with six nodes and eleven links, Figure 26 is a diagrammatic analysis of the network of Figure 25, Figure shows a connection centre and recording centre embodying the analysis of the network of Figure 2 in a machine for putting an extraction process into operation, Figure 28 is a logical diagram of a connection element EL allotted to a weighted node or level, Figure 29 is a logical diagram of a circuit of elabora-tion where the element EL of Figure 28 is used, Figure 30 shows the modification of a connection element EL comprising several memories Bo» Figure 31 shows the modification of an element of CAS in the case where the element EL comprise several memories Figure 32 shows an element of memorisation centre having several memories, and Figure 33 shows active memory connected to a second active memory at the region of a centre of association of actions.

BASIC STRUCTURES AND GENERAL LOGIC OF AN ACTIVE MEMORY Since the transformation of a system defined by several parameters may be represented in a n-dimensional space by two points and a chain of vectors joining these two points, what are the pieces of information which must be stored to bring about the inscription i.e. the recording? How can the information be broken down into simple elements which are easy to store? These are the two questions the reply to which enables the basic structure of an active memory to be determined.

For practical reasons, the n-dimensional space considered is a discrete space, which means that each parameter (also called a "variable") takes only discrete values.

Moreover, it is supposed that the number of quantification levels of each of these parameters is finite: in a machine which will be described below by way of example, this number is 12 for each parameter. Each quantification level of a parameter represents a situation in accordance with this possible parameter for the system and for this reason we shall speak sometimes of levels of situations in the active memory.

There will be examined the case of a complex activity composed of a complex situation, a complex action starting from this situation and the resultant complex situation, and the end of said complex action. This complex activity may be represented by a point P, a vector V tied to this point, and the end point of this vector, which end point is defined bi-uni ocally by the knowledge of the first two elements.

In the space considered, the point P is defined by its n co-ordinates. As free vector, the vector is defined by its n components. The complex action will be defined completely if there is expressed a condition of connection of the vector to the point considered. The memorisation or storage of a complex action will be translated in the active memory by the presence of the following three types of information: 1. The association of the co-ordinates of the point; 2. The association of the components of the vector; 3. Fo each parameter the coincidence of the value of the co-ordinate of the point and of the value of the component of the vector in accordance with this parameter.

Thus, for the transformation shown in Figure 1 with parameter X and Y, the information to be stored is represented by the conjunction of co-ordinates and of components in brackets as given by the following Table: Association of the co-ordinates of P 1 (called information 1) (1,2) -→ Association of the components of V (called information 2) (+2,+l) Coincidence of the co-ordinate of P and of the component of for each parameter. (called information 3) :(l,+2) Y :(2,+l) If one stores a single complex activity at the start-ing point P considered, information 1 and information 3 are sufficient to find this complex action; if one memorises for instance two transformations (P, V^) and (P, Y^) starting from this same point (see Figure 2): i 1st transforma ion 2nd transformation Information 1 P (1,1) Information 2 f (+1,+1) (+2,+2) Information 3 X (1,+D (1.+2) Y (1,+1) (l,+2) It is found that the information 1 and information 3 by themselves do not make it possible to find bi-univocally the transformation (P, ^) and (P, L,) · ^11 fact, the transformations (P, V^) and (P, V^) would lead to the same —ί information 1 and information 3 if the components of were (+1, +2) and of were (+2, +1). On the other hand, the addition of the information 2 enables these transformations to be excluded.

CENTRES OP STORAGE The types of information 1, 2 and 3 defined above are memorised by means of storage elements (EM) of the binary type, i.e. comprising two states, one indicating that the information which is alloted to it is not stored and the other indicating that the information is stored. To simplify the terminology, it will be stated that these memory elements EM are bistable rockers, the non-rocked position corresponding to the non-stored state and the rocked position to the stored state.

The type of information 1, 2 and 3 are sufficiently simple to be able to be shown by the position of a binary storage element, if the structure of the active memory is set up in the manner explained below: (a) Centre of Association of Situations (CAS) To memorise the associations of co-ordinates of points (information 1), there are provided as many storage elements EM as there are points in the space considered.

The association of the co-ordinates of a point corresponding to a complex situation is memorised if its storage element EM is rocked. The set of these storage elements constitutes the CENTRE OP ASSOCIATION OF SITUATIONS (CAS) , the number of quantification levels being capable of being different for each of thedifferent parameters.

In the spaces with more than two dimensions, the association of the co-ordinates of the points implies a considerable number of storage elements EM. In fact, the representation of a space with n-dimensions having p-levels of quantification in accordance with each of them, will necessitate p2" elements, and the number will quickly become prohibitive as the number of dimensions increases. This difficulty is overcome by projecting this space having n-dimensions into sub-spaces with at least two dimensions. In the planes thus formed (for the sub-spaces with two dimensions) , one associates in pairs the co-ordinates of the points of the space by storage elements; as a result the association of the co-ordinates of a point of the n-dimensional space representing a complex situation is stored, not by the rocking of one storage element, but of several storage elements EM corresponding to the projections of said point in the planes considered. There will thus be several centres of association of situations, each parameter appearing in a number of them. (b) Gentre of Association Actions (CAA) To store the associations of the components of vectors representing complex actions (information 2), one proceeds in the same manner by providing as many storage elements as there are possible free vectors in the space considered. The association of the components of a free vector is stored if the storage element EM corresponding to this free vector is rocked. The set of these memory elements forms the CENTRE 03? ASSOCIATION OF ACTIONS (CAA).

When there are more than two dimensions in the space considered, one proceeds in the same manner as for the Centres of Association of Situations (CAS) by creating several Centres of Association of Actions (OAA) associating for instance the components of the vectors in pairs.

In practice, one may be led to limit the number of free vectors capable of being stored, i.e. the number of actions capable of being effected from a complex situation. Thus for instance, one may prescribe that in an active memory taken by way of example the components of the vectors of the space considered cannot exceed twice the unity of measurement of the axis of co-ordinates considered. Accordingly the components of the free vectors on each axis will be limited to the following five values: - 2, - 1, 0, + 1, + 2. One can of course permit possibilities of variation which are different in number or in amplitude in accordance with the parameters. (c) Recording Centre (CI) To store the information for 3 for each parameter, i.e. the coincidence of the value of a co-ordinate of a point and of the value of the component of the vector associated with it, there is provided a storage element for each coincidence possible.

In a machine taken by way of example, one will accordingly have for each value of a co-ordinate five memory elements representing respectively the coincidence of this co-ordinate with the components - 2, - 1, 0, + 1, + 2 of the vectors capable of having their origin at the point representative of a complex situation in the corresponding space. All the storage elements capable of storing this coincidence for all the values of a parameter form the RECORDING CENTRE also called CI.

If the number of levels of quantification on an axis is 12, there would be accordingly 5 x 12 = 60 storage elements for each Recording Centre. Moreover, then there exists one Recording Centre for each axis of co-ordinates of the n-dimensional space considered, i.e. one Recording Centre for each parameter.

Figure 3 is diagrammatic representation of the basic structure of an active memory with two parameters X and Y. Each storage centre is composed of a matrix structure, each storage element being represented by a square. The recording centres CI, equal in number to the number of parameters, are matrices with two dimensions, one dimension is allotted to the values of the parameter, or situations, and arranged opposite the centre of association of situations CAS; and other dimension, is allotted to the values of variation of the parameter, or actions, and is arranged opposite the centre of association of actions CAA. The CAA and the CAS represent the connections "between parameters. Thus, the storage elements marked in thick lines in Figure 3 represent a complex action which may be analysed as follows: point P of co-orinate (1, 2) connected to the vector V (+2, +1); for the parameter X the coincidence of the action +2 and of the situation 1 is stored in the CI for X just as for the parameter Y the coincidence of the action +1 and of the situation or level 2 is stored in the CI for Y.

Moreover, to represent certain forms of recording there exists also a connection centre CL for each parameter placed opposite the corresponding CI and comprising as many connection elements EL as there are situations in accordance with the parameter; each connection element EL is then connected to the members for controlling the recording.

LOGICAL FUNCTIONING OF THE RECORDING AND EXTRACTION To simplify the explanation of the logical functioning of the machine, it will be supposed that the storage elements are distributed in CAS, CAA and CI so as to be accessible to an operator who is able to control the ricking of them as desired, and to be informed continuously, visually for instance, of the state of this set of storage elements.

RECORDING To store a complex action represented in a space with two dimensions by a point and a vector extending from this point, the operator proceeds as follows:- 1. rocks the storage element of the CAS associating the two co-ordinates of the starting point; 2. rocks the storage element of the CAA associating the two components of the free vector equipollent to the vector considered; and 3. rocks in each CI the storage element embodying the respective coincidence of the co-ordinate of the point and of the components of the vector in accordance with each parameter to store the information that this vector is connected to the point.

If, instead of a complex activity comprising a single complex action, one wishes to store a transformation comprising a chain of complex actions, the operator will rock successively the memory elements corresponding to the successive complex activities of which it is composed between the initial complex situation and the final complex situation.

The transformation may be supplied to the operator in charge of the storage operation in the form of a description of the successive complex situations, which description indicates directly the points of the CAS which will have to be stored, including the last. The operator will be able to deduce from the variation of the parameters defining the successive situations the components of the vectors which he will have to record in the CI at the level of each situation; he will deduce also from these components the storage element of CAA which he will have to operate at each step. 51 In practice, these operations will he carried out automatically "by the machine from information received from sensors, also called members for posting or controlling members for recording, supplying the successive values of the various parameters directly to connection elements. In an embodiment, the recording centre attached to each parameter comprises two series of entries, the first corresponding to the present situation of the parameter and the second to the immediately preceding situation stored temporarily in memory in the connection centre; the entries of a CAS allotted to the same parameter are connected to this connection centre, the entries of a corresponding CAA being connected to the outputs of the recording centre.

EXTRACTION Extraction is the phase of interrogation of the active memory after information has been communicated to it, for instance in the form of previous experiences as above, or by some other means.

The interrogation consists in asking this memory if there exists a transformation making it possible to connect by means of the stored information, a situation which is identified as an initial situation and a situation which is identified as final situation. If at least one such transformation exists, the active memory is able to supply the shortest transformation, i.e. that which comprises the minimum number of steps.

Example If the active memory has stored the transformation corresponding to the trajectory AB in a space having two dimensions in FIGURE 4, as well as the transformation CD, the active memory interrogated on the possibility of joining D from A will reply that the transformation is possible and will indicate the chain of complex actions corresponding to the trajectory shown in double lines.

If one then records the trajectory AD shown in dashes and one interrogates the active memory again, it will again indicate the trajectory in double lines for connecting A to D, this trajectory comprising only steps, whereas the trajectory in dashes comprises 8 steps.

From the technical viewpoint, the active memory comprises, after a recording phase, a certain number of rocked memory elements EM in each of its centres.

For the extraction, one proceeds step by step, or if desired by successive complex activities. To check whether a complex activity starting from a recorded complex situation a and terminating in a complex situation b accessible in one step only is stored, the associated space comprising two dimensions in this example, it is checked that: (a) the element of CAS corresponding to the representative point b is rocked; (b) the element of CAA corresponding to the representative free vector a"b is rocked; and (c) the two elements of CI corresponding to the tied vector ab are rocked; Thus, if there is to be determined the shortest transformation connecting an initial complex situation A to a final complex situation Z, both being recorded in the memory, the logical process of extraction will proceed in the following manner.

The element EM of GAS corresponding to Z is rocked. A search is carried out for all the recorded points Y^ ... from which Z is accessible in one step by examining all the complex activities terminating in Z, and by retaining only those which have been recorded and which are possible, that is to say: 1. the elements EM of CI corresponding to the tied vectors Y-^Z .... YnZ are rocked; 2. —t>he elem—ents EM of CAA corresponding to the free vectors Y-^Z .... Y^Z are rocked; and 3. the elements EM of CAS corresponding to the retained points Y-^ .... Yn are rocked. In certain cases, a supplementary condition is added for each selection, i.e. that the elements EM of CAS considered should be found in the square or rectangle (or cube or hypercube in accordance with the number of dimensions of the CAS considered) containing the element EM corresponding to the points from which Z is potentially accessible in one step by the maximum amplitude actions. This condition, called condition of proximity, is however redundant for the first step of the search.

When this operation is terminated, one faces again the same problem, i.e. to determine all the points X from which at least one of the previously selected points Y is accessible. The points X from the points Y are determined by making use of the same method of checking in the storage centres which has given the Y from Z.

Proceeding thus by repetition, and if the problem includes a solution, a point B will necessarily be met which will be accessible in one step from the original point A. There has then been carried out a retrograde investigation, or phase § . By tracing the path Z,Y, X ... which has made it possible to reach the point B, there can be identified the path A,B,G ,.Χ,Υ,Ζ which represents the shortest path, i.e. comprising the minimum of steps, for passing from the point A to the point Z.

The vector AB constitutes the first step of this path.

If, for simplicity, it is imagined that the search by repetition which has jus been described has been carried out by an operator endowed with a very good memory, he will be able to recall from which points the point B has been reached, and by retracing the steps to determine the minimum AZ path.

Infact, a strict method for determing this path know-ing the vector AB consists in fixing the point B as a fresh starting point, which operation will be considered as a result of a phase ¾ and in recommencing a further retrograde investigatio ^ up to a point C accessible in one step —ϊ from B. The second vector BC of the minimum path sought can thus be determined by a second phase ^ with the view to fixing C as a fresh starting point.

Proceeding in this way with fresh starting points, the operator will be able to determine the totality of this 55 minimum path step "by step.

In the whole of the following explanation, it will be supposed that the process of extraction applied to the active memory permits the carrying out of a system external to the machine, a system whose sequence of successive states constitutes the transformation sought for. This system is guided step by step, from the initial situation to the situation designated as the end of its evolution, by means of information issuing from the machine in the course of the extraction. At the end of a step, the intermediate situation of the system, also called for this reason present or actual situation, constitutes the starting situation of a next activity of the transformation extracted.

The successive determination by retrograde exploration of the vectors of the minimum path gradually as the system controlled utilises then, has the advantage that if fresh information (new possible vectors) appears in the course of the operation the next retrograde exploration will take the fresh information into account for the determination of the path which will guide the system, for instance a moving object, to the target, from the point where this moving object is found at the moment of the appearance of the fresh information.

Note 1 In the course of the search by repetition, it may happen that the operator meets simultaneously two points G, K. and Gq which are accessible in one step from the point 3? representing the present or actual situation. The two vectors FG, and FG each belong to a transformation having a minimum ■K q number of steps between A and Z. There are accordingly two equivalent transformations; if the operator is interested in the determination of a single path it would be necessary for him to chose between the point G^. and the point G^ as the next actual situation for the determination of the next actual situation for the determination of the next vector GH of the shortest path.

This choice is in most cases a necessity (when guiding a moving body for instance) , and in the case where the operator is not permitted "free will" , it will be necessary to supply it with rules for making a choice between the equivalent solutions.

In the absence of an external parameter capable of resolving the alternative, it is necessary to have a parameter in the interior of the memory which supplies automatically a criterion on choice and for instance sets up a hierarchy among the complex activities detected.

Note 2 In all the above, to simplify the explanation it has been supposed that the extraction, that is to say the search for the shortest chain of complex actions between two situations, taking into account past experience, i.e. the storage of a certain number of actions and of situations, has been carried out by an operator examining the rocked or unrocked position of the storage elements of the various centres of the machine.

Such a search becomes practicable by means of a machine, if, instead of carrying out the exploration from the target by an operator checking one after the other the states of the storage elements to determine those which are accessible in one step, this exploration is realised by sending simultaneously from representative elements of the final complex situation, signals towards the storage elements. These signals will be blocked if the elements do not correspond to points accessible in one step or, if the contrary is true, will be transmitted again from these elements. In a retrograde investigation, the signals would be relayed by degrees until, simultaneously for each parameter, one of them reached the element representative of the initial complex situation for this parameter.

In order to effect by means of signals the logical operations previously explained above using a human operator, it is necessary to provide the active memory with an automatic operation, but this latter does not change the basic structure of this active memory and its general logic of operation.

Thus equipped with automatic operation, the machine is capable of carrying out retrograde investigation operations^ , and successive determination in phase <_f of each step of the transformation sought for, at considerable speeds which make it a powerful information-providing machine capable of solving numerous problems, in particular of a combinatory nature, which are difficult to solve on standard computers.

Combinatory Power of the Active Memory If an action in accordance with a parameter has been learnt by the active memory from a certain level of this parameter, it is learnt for all the complex situations of the same level in accordance with this parameter.

Example; See FIGURE 5 In a recording centre allotted to the variable Y(CI-I), the action +1 is stored by recording a complex activity starting from an initial situation (X^Y^) j is supposed that a second situation (X^^ is recorded in the machine by rocking the corresponding element EM in the CAS.

During an extraction phase, i.e. a phase of exploration of the state of the machine to obtain from it stored . complex activities, there is nothing to permit the determination to be made of whether the action +1 starting from the level Y^ has been stored in connection with the complex situation ( -^Υ^) or with the complex situation ^ΐ^ .

In other words, other things being equal in the other centres, one will be capable of retaining in extraction, as a stored complex activity, a complex activity not effectively recorded and comprising the action +1 in Y from the situation ( ^Z-^ ' The complex activity apparently recorded previously may lead to a complex situation effectively recorded; in this case, a complex activity will be maintained, either for carrying out the extraction, or as belonging to the transformation sought for. It may also happen that the complex activity apparently recorded terminates in an 59 non-memorised complex situation (or not fulfilling the condition of proximity) in which case it will "be rejected after verification in GAS that the element EM corresponding to this situation has not rocked (or is not to he found in the square or rectangle representing the condition of proximity) .

By virtue of the phenomenon which has "been set out by way of example for an action +1 in accordance with T, the machine possesses a true combinatory or associative power.

It is in fact capable, during its extraction functioning, of connecting together two complex situations which have been recorded by a complex action effectively recorded, (in certain cases even by a chain of complex actions effectively recorded), although this action (or this chain of actions) has not been recorded in connection with these two situations, i.e. although the complex activity has not been recorded.

Example : See FIGURE 6 It is supposed that in the course of the recording of three separate transformations, the following complex activities have been recorded.

First Complex Activity Complex situation: (X-jY^). Complex action: (0 on X, +1 on Y) by rocking the element EM I in the CAS, the OIs and the CAA. The end complex situation resulting is marked by the element EM I rocked in the CAS.

Second Complex Activity Complex situation: ( ^ΐ^ · Complex action: (+2 on X, 0 on Y) by rocking of the EM II in the CAS, the CIs and the CAA. The end complex situation resulting from the conplex activity is marked by EM II rocked in the CAS.

Third Complex Activity Complex situation: Complex action: (+2 on X, +1 on Y) by rocking of the EM III in the CAS, the CIs and CAA. e end complex situation resulting from the complex activity is marked by the EM III rocked in the CAS.

The examination of the state of the active memory then shows that the following complex activity is also implicitly recorded: Complex situation (XgY^) . Complex action (+2 on X, +1 on Y) since on the one hand: the EM II is rocked in the CAS, the EM II is rocked in the CI corresponding to the parameter X or CI X, the EM I is rocked in a CI corresponding to the parameter Y or CI Y, the EM III is rocked in the CAA; and since 6n the other hand, the complex end situation °f "this complex activity is recorded in the CAS by the EM III rocked, This combinatory power of the active memory makes of it a very powerful machine for the solution of complex problems which are of a marked combinatory character.

General Arrangement of an Active Memory It has been seen that the basic structure of an active memory includes in particular memory elements grouped in centres of different types such as: (see Figures 3 and 11) Centres of Association of Situations or CAS.

Centres of Association of Actions or CAA Recording Centres or CI.

With these elements alone, the memory is capable of storing a considerable number of transformations called previous experiences; these can be used for reading, from the elementary complex activity forming the previously stored experienced, the minimum number of steps enabling one situation to be connected to another.

This process of extraction, as for the recording process, may be carried out by means of an automatic operation which will be described below.

Finally, the active memory includes peripheral equipment enabling it to communicate with the exterior. From this apparatus mention may be made of: (a) Apparatus concerned with input to the machine» in particular posting members for situations or successive actions of a transformation in Recording, and posting members of an initial situation and of a final situation in Extraction. (b) Apparatus concerned with the output f om the machine capable of using as they become available, the indications supplied by the active memory on the successive steps of the transformation sought for which connects an initial complex situation to a final complex situation.

A form of such exploitation may, for instance, consist of a visual display, on screens provided with a mobile index, of intermediate situations constituting for each parameter the determination of a step of the optimum transformation sought for. The display may also be provided on luminous double entry boards, connecting in pairs each parameter, by the posting of intermediate situations.

If the active memory supplies to a system orders corresponding to actions to be carried out in accordance with each parameter for accomplishing the step, these orders may be used directly by control members of the system, for example, for the control of an industrial process or the piloting of a movable object.

If the active memory supplies orders corresponding not to actions but directly to intermediate situations, and the display previously envisaged constitute particular cases of this type, these orders will be transmitted to servo machinisms which will ensure the carrying out, by means of control members, the actions leading to the new situation. The memory will then wait for the return message indicating that the intermediate transformation has been carried out, in order to post the following one.

Automatic Operation and the Memory Elements The automatic operation carries out a recording process by sending storage signals on lines which intersect at the storage elements, and which, if they are energised simultaneously, bring about the storage operation of the memory elenents at which they intersect, both in the recording centre and in the centres of association of actions and of situations.

In the extraction process, the function of the automatic operation is to cause research to progress by sending to the various memorised centres signals of simultaneous interrogation in accordance with each parameter, which signals will give rise to authorisations if they intersect at the memorised elements. To each possible situation in accordance with each parameter is allotted a connecting element which enables the progress of the search to be checked; for each parameter, the set of the connecting elements forms a connection centre.

Memories permit the registration of the various stages of the progress of the signals in the course of the search.

Thus, in the example just described here the automatic operation comprises essentially (See Figure 11) : (i) a Co-ordination Centre CC with a clock; (ii) the elements of CAS (called EAS), which, in addition to their proper memories, include a logical system which ensures the progress of the retrograde search; (iii) connecting elements EL grouped in connection centres CL; and (iv) lines capable of carrying the signals.

Before passing to the description of the elements, a list of the signals supplied by the co-ordination centre will be given, as well as the nane and definition of the various lines (the signals which they carry taking the sane nane) . (a) Signals supplied by the co-ordination centre CG (RAZ B ... = Return to 0 of the bistables of the type ..) Recording INS T 2 INS T 1 RAZ B INS Tine " Extraction β Ti Starting A RAZ Bl RAZ B2 Time X Normal Starting A RAZ Bl AUT.SORT ACT = authorisation of the output of the actions.

Tine Y with Hierarchy Sane as nornal but also: IHH CDE BAM prohibition of the control of the bistables of multiple action.

RAZ BAM return to 0 of the bistables of multiple action AUT CDE BH authorisation of the control of the bistables of hierarchy INH H probition of the priority inter-actions AUT MOD H authorisation of modification of the priority interactions Time S RAZ BO AUT 1 RAZ B 1 (b) Nomenclature of the various lines as a function of the signals which they carry, MEM CAS: carries a storage signal CAS sent by a EL to all the CAS elements of its level which by intersection with a signal carried by an identical orthogonal line brings about the rocking of the storage element of CAS (FIGURE 11c: the line MEM CAS Y coming from a connection centre CL allotted to the parameter Y intersects with the line MEM CAS X coming from a connection centre, not shown, allotted to the parameter X; the two lines are connected in the element of CAS defined by a square dram in dashes on a gate Λ 1001) MEM CAA: storage CAA. It has the same role as the above for the CAA, but for the signals sent by the CI (FIGURE lib) instead of the CL.

MEM OACI: carries a signal of storage of origin of action in the recording centre sent by a connecting element EL to all the recording elements EI representing actions issued at its level (FIGURE lib and 11c).

MEM EACI: carries a signal of storage of end of action in the recording centre, sent by an EL to all the recording elements ΞΙ representing actions terminating at its level.

The intersection of two signals carried by the lines MEM OACI and MEM EACI at a recording element EI rocks its memory and brings about the transmission of a signal on the corresponding line MEM CAA (FIGURES lib and 11c).

INT OACI: Interrcgation of origin of action in the recording centre I, the interrogation being sent by an EL towards the Els representing the action issued at its level (FIGURES lib and 11c).

INT EACI: interrogation of end of action in the recording centre (FIGURES lib and 11c) , the interrogation being sent by an EL of the Els representing the actions terminating at its level.

AUT OACI: authorisation sent by an EI to the EL located at the level of the origin of the action which it represents (FIGURES lib and 11c).

AUT EACI: authorisation sent by an EI to the EL located at level of the end of the action which it represents (FIGURES lib and 11c).

INT CAA: interrogation sent from all the recording elements EI allotted to the same action in a CI towards the corresponding elements of CAA (EM) . When the same parameter intervenes in n CAA, it divides into n lines INT CAAp each directed towards CAA (FIGURE lib).

AUT CAAp: authorisation sent by an element of CAA towards the Els corresponding to the same action (FIGURE lib) AUT CAA: line of authorisation received by the Els corresponding to the same action and sent from the point of convergence of the lines AUT CAAp coming from the nCAA in which the parameter considered appears (FIGURE lib) .

INT CAS: interrogation sent from an EL to all the elements of GAS situated at its level (FIGURE 11c).

Other lines (IET ¾, B2 = FINβ ....) will be introduced in the course of the following explanation, as need arises.

In a general manner, the lines may assume functions of storage (HEM), of interrogation (INT) and of authorisation (AUT). With regard to the lines connecting the centres of association to the ELs or to the EI, it will be said that they have a function of interrogation (INT) if they carry signals towards a centre of association (in the case of lines INT CAA and INT CAS) , and a function of authorisation (AUT) if they carry signals coming from a centre of association (in the case of lines AUT CAA and RET Bl for instance).

FIGURE 11 shows the general interconnection between the elements now described. In the interior of these elements there are illustrated only the gates in relation to the lines external to the element, accompanied by their references.

Reference may be made therefore to this FIGURE 11 to locate each of the elements in relation to the arrangement of the system.

The connections to two other CAS and CAA, not themselves illustrated, have been shown, but this number is not at all essential , nor is to restricting. (c) Elements of CAS or EAS (FIGURE 7).

These comprise essentially three memories which will be called bistables in view of their electronic construction. One of them, B 1004, constitutes the memory element proper of the CAS. It is in the logical state 1 when the situations of the two parameters corresponding to its coordinates have co-existed, but if not it is the logical state 0.

The two other.-.>memories , designated respectively Bl (1007) and B2 (1012) form part of the system for ensuring the progression of the retrograde search.

The retrograde search is carried out during a period called time β. This time periodβ may be divided into a series of alternate elementary periods Tl and T2. At the time βT2 the intermediate targets attained at this instant are represented by the rocking of the corresponding bistables B2. The carrying out of the search step β T2 consists in rocking the bistable Bl of the elements of CAS from which at least one element marked by its B2 is accessible in one step.

The time βTl is only a period of internal transfer of Bl to B2 in the interior of each element, which transfer prepares the following time β T2.

FIGURE shows the logical diagram of an element of CAS. An element of CAS cannot be the origin of a complex action lead-^ ing to an element of CAS having its B2 rocked unless this element is located in a square, shown in double lines in FIGURE 18, having as its centre the element considered, and whose edges will be extreme situations which the actions of maximum amplitude, registerable in each CI, permit to be attained by each parameter. The gate 1008, called the OR gate of proximity represents this condition: its inputs are connected to the B2 of the accessible elements. It accordingly comprises 8 inputs if the possible actions in the two parameters are +1.0 -1, as has been illustrated in FIGURE 18, and 24 inputs if the possible actions are +2,+1,0,-1,-2 and so on. It verifies during the time β T2 (by A 1009 and (\1010) an i put of the gate VL006 which controls the rocking of the bistables Bl (100?).

The proximity gate C 1008 accordingly makes it not possible to rock the bistable Bl of an element of association of two situations EAS at a given instant of the search, unless there is rocked at least one bistable B2 of the elements which join situations potentially accessible in one step in accordance with each parameter, from each of the situations joined by the element considered.

Gate 01001 brings about the rocking of the bistable of memory 1004 when the two lines of memorisation MEM CAS X (1002) and MEM CAS Y (1003) are energised, X and Y being two joined parameters in the CAS considered.

The state 1 of the memory verifies through the gate V 1005 one input of a gate ft 1006 called an AND gate of association. The second input of the gate U 1005 is supplied by a general line PROJ common to all the elements of the CAS.

A signal 1 applied to this line appears at the outputs of all the gates Ul005 of the element of CAS, thus simulating the rocking of their memory elements. This amounts to authorising the passage of the transformation to all xthe points of the CAS, whether memorised or not. It is the function of projection of the GAS.

At the tine of Tl, the gate {#1011 brings about the rocking of the bistable B2 (1012) if the bistable Bl is rocked.

The connection 1013 of return of the state of B2 to the gate U 1010 has the role of authorising the rocking of the Bl of an element by its own B2. There will be seen below why this return is not subjected to the condition β T2.

The third input of the gate UlOlO, narked P is fed by a line comiaon to all the CAS, the energisation of which line has the effect of authorising the rocking of the Bl without condition of proximity of a B2.

The role of the other lines, which join the elenent of CAS to the connection elements and to the co-ordination centre CC, will be described at the same time as the general logical circuit. (d) The connection elements or EL (FIGURE 8).

The connection elements are grouped for each parameter in a connection centre, and they are each allotted to a situation in accordance with this parameter. For an active memory capable of taking into account 12 situations per parameter, the connection centres will accordingly comprise 12 elements (S for instance FIGURE 3). In the example of an active memory illustrated by FIGURE 8, they have two independent paths, separated diagrammatically by a dot-dash line in this FIGURE, allotted respectively to recording and to extraction.

For recording, they have the purpose of entering into the memory, temporarily by means of a memory B INS 1114, posting instructions of a situation in accordance with this parameter.

For extraction, they must ensure coherence of the progression of signals in the various CAS Joining the parameters in pairs. They also restrict this progression to utilising at each level only the actions recorded in the CIs.

In the active memory taken as an example the portion allotted to extraction includes essentially :- (i) gates Their operation will be described in the course of the explanation of general functioning. (e) Recording Elements or EI (FIGURE 9) The role of the recording elements EI is to store the actions which have been carried out from each of the levels of the parameters.

As well as a memory B1201 operated in recording through the lines MEM EACI and MEM OACI converging on a gate ■ ) 1209, the recording element includes a gate f) 1209, the recording element includes a gate Λ 1203, called a gate of elementary activity having three inputs, one connected to the output of the memory B1201 and the other two respectively to the lines INT OACI and INT EACI terminating at the element considered, the output of which is capable of energising a line INT CAA through a gate U 1204. The element includes also a gate Π 1205, called a gate of authorisation, having two inputs, one connected to the line AUT CAA corresponding to the preceding line INT CAA, and the other energised by the output of the gate of elementary activity f\ 1203. The outlet of this gate of authorisation ft 1205 makes it possible to energise the line AUT OACI of the element through a gate U 1206; the line AUT EACI through a gate U 1208; and the line SORT ACT through a gate ( 1207 The role of this gate of authorisation A 1205 is to allow the delivery of an authorisation signed by the recording element only if this element, having been interr gated at the elementary activity gate f 1203 , has replied positively by interrogating in its turn and if it has received an authorisation of the CAA for the action which it represents.

The input of the gate U1202 , narkud "TEN" is energised by a line common to the CI, called a line of generalisation, the energisation of which has the effect of simulating the the storage operation of all the elements.

As in the case of EL, its operation will be described during the explanation of the general operation. (f). The elements of CAA or EAA (FIGURE 10) Each element of C represents by its storage operation that the combination of actions following two parameters to which it is attached has existed at least once in the previous experiences.

Each element of CAA includes a memory B1301 capable of being rocked by the lines MEM CAA X and MEM CAil Y connected to the inputs of a gate Λ1302. It comprises moreover an association gate f) 1304 which supplies authorisation signald AUT CAA X and AUT CAA Y if the element receives simultaneously INT CAA X and INT CAA Y and if moreover the bistable B1301 is rocked.

As with the CAS, the CAAs include a common line called a line of projection, the energisation of which has the effect of simulating through gates U 1 03 the storage operation of all the elements.

If the parameter to which a given recording centre is allotted appears in several CAA, the lines of authorisation extending from these CAA towards the CI are lines AUT CAAp which converge on a coherence gate 0 14-01 (See FIGURE 11).

DESCRIPTION OF THE GENERAL OPERATION This description will be given from the start for a mach'ne having more than two parameters, i.e. in which at least one connection centre allotted to a parameter is connected to two or more CAS and at least one CI with two or more CAA.

The names of the various lines, as well as the corresponding abbreviations will be introduced in the course of the explanation as need arises.

Recording The information supplied to the system is the instantaneous values (or situations) of the various parameters at successive instants.

Each of the connection centres has n inputs each corresponding to a possible situation. These inputs are connected to connection elements at the corresponding level.

They are designated by the words "Control Recording" (CDE INS 1121) in the diagram of the EL (FIGURE 8).

On each delivery by the posting members in recording of a set of values of the parameters, the coordination centre supplies three successive signals : INS T2, ΕΔΖ B INS, then INS Tl. At the first time INS T2, all the bistables B INS being in the logical stage 0, the CDE INS brings about through gates A 1116 of the EL the transmission of a signal MEM EACI and through gate A 1122 the transmission of a signal MEM CAS. The signal MEM EACI is without effect in the CI, since no line MEM OACI is energised. In the element of CAS (FIGURE 7), the intersection of two signals MEM CAS (1002 and 1003) brings about the energisation of the gate f\ 1001 which controls the rocking of the bistable of memory CAS 1004.

At the time INS Tl, the gate 1117 (FIGURE 8) rocks the recording bistable 1114 of EL. The level of the parameter which has just been energised is accordingly now stored in this bistable. It will constitute the origin of the vector, causing the transition to the next level, which will be energised.

When the posting members supply the following set of the values of the parameters, the signal INS T2 has two effects. It brings about as above, ¾he storage of the point in the CAS by the signal MEM CAS. It verifies the gates A 1115 and 1116 (FIGURE 8) of the EL. At the level reached by the preceding CDE INS, the EL has its recording bistable (1114) rocked; the gate Alll5 sends a message MEM OACI. At the level reached by the present or actual CDE INS, the gate 1116 sends a message MEM EACI. These two messages intersect at the EI representing the transition of the preceding level to the present of actual level. There they bring about the energisation of the gate f 1209 (FIGURE 9) which rocks the memory bistable 1201 of the EI and, through the gate Ul210, sends a storage signal MEM CAA to the CAA.

In each CAA, two messages MEM CAA intersect, and energise the gate (} 1302 (FIGURE 10) which rocks the bistable 1301 which constitutes the memory of the CM.

After the signal INS T2, the co-ordination centre brings about the return to zero of the recording bistables B INS 1114 of the ELs (signal RAZ B INS). This has the effect of erasing the B INS corresponding to the first level energised. ¾e system is now ready to receive a fresh piece of information, and the process of recording continues in this way until the last point.

Thus, given a previous situation stored temporarily by the bistable B INS 1114 of a connection element in the course of the preceding recording tine, and a present or actual situation posted in another connection element by the recording control signal (CDE INS) at the time INS T2, a recording circuit energised at the time INS T2 and illustrated by FIGURE 12 comprises : in the element corresponding to the present or actual situation, the line EME EACI extending from the gate A1116 verified by the signals CDE INS and INS T2 and a line MEM CAS extending from the gate Π 1122 verified by the same signals; in one CAS, an element on which the line MEM CAS Y intersects with the line MEM CAS X coming from the EL corresponding to the present ot actual situation in the connection centre allotted to the parameter X (in this element, the two storage lines verify the gate ft 1101 and "bring about the rocking of the memory B 1104·; in the connection element corresponding to the previous situation in accordance with Y, the line MEM OACI extending from the bistable B INS 1114; in the recording centre, the element at which intersect the preceding lines MEM EACI and MEM OACI verifying the gate f 1209 which on the one hand operates the memory B 1201 and on the other hand sends via the gate V 1210 a signal on the lines MEM CAA leaving the element considered; and in one CAA, an element at which one of the preceding lines MEM CAA Y intersects a line MEM CAA X extending from the recording centre allotted to the parameter X, the gate f) 1302 verified by the two lines bringing about the operation of the memory B1301 of the element of CAA considered.

NOTE 1: As will be observed below, the gates, bistables and lines which have been used in recording do not play any part in extraction. It will accordingly be possible in the course of extraction to supply fresh information to the active memory, taken here by way of example, which information will immediately be taken into account for setting up the optimum itinerary, by reason of the fact of the repetition of the retrograde search at each step. When one does not wish to make use of such a possibility, one can construct an active memory in which certain parts at least of the recording circuits serve also for the extraction.

NOTE 2; The recording process which has gust been described enables information resulting from acquired experiences to be stored in the elements of the various centres.

The process accordingly enables the representation for a system of the transformations, constituted by the passage from an initial complex situation to a final complex situation, by a chain of intermediate complex situations. For putting it into operation, the memory has for each parameter a connection centre comprising as many temporary memory elements as there are possible values of the parameter, and the recording centre has two series of inputs respectively OACI and EACI, connected to the connection centre, the inputs EACI corresponding to the present or actual situation of the parameter and the inputs OACI corresponding to the immediately preceding situation stored in the connection centre.

One can also conceive another method of recording consisting in rocking directly the memories of certain elements of CAS, CI and CAA, without being concerned with knowing if these storage operations can result from an actual experience. This amounts to asking the active memory to construct in the course of the extraction phase (if this is possible) an optimum trajectory by utilising transition points (CAS), components of vectors (CI) and associations of these components (CAA) fixed arbitrarily by the operator.

This type of recording is more general in principle than the first, and lends itself to taking into account problems frequently met with in actual practice, in which the constraints joining the parameters to each other are not known totally but only partially from experiences giving knowledge of the correlation between certain parameters . Frequently, this type of constraint will be expressed by the existence of zones where the development of this system is prohibited, and they will be stored by effecting in the storage centres a recording by fields. The memory which has just been described lends itself particularly well to dealing with this type of problem and the putting into effect a system of extraction allowing the determination, by means of information supplied to the machine, of a total transformation causing the passage in the optimum manner from one complex situation to another, while respecting the data and in particular the stored constraints.

This type of recording will be called "incoherent recording" .

Extraction Time β The principle of the retrograde search by the operation of bistables Bl - B2 of the element of CAS has already been explained. There will now be described the manner in which the progression of this search is controlled by the elements for connection, recording and association of actions. FIGURE 15 shown the. signals supplied by the co-ordination centre during the time β The complex situation in which the system controlled by the active memory is found at a given moment is characterised by a situation or level in accordance with each parameter. In the connection centre associated with each of the parameters, this level is represented by the rocking of the bistable Bo (1108) of the corresponding connection element. id interrogate the machine, it is necessary to fix for it an origin and a target composed of an initial complex situation and a final complex situation. The origin is fixed by rocking, through the gate \ 1118 via a signal MAM BQ (storage Bo), the B0 of the ELs corresponding to the starting situation in each of the parameters. The rocking of the B0 d)f a level represents the actual or present situation in which the system in accordance with the parameter concerned is placed.

In putting into operation the extraction process, the target remains the starting point of each retrograde investigation. On the other hand, after each^phaae, the origin, which represents at each instant the state of the system controlled by the active memory, and which constitutes the arrival of the next retrograde investigation, is changed.

The final complex situation is posted by rocking in each CAS the B2 corresponding to this situation. The end of the first step of the retrograde investigation βwill be marked by the rocking of a certain number of other B2 in the elements of CAS corresponding to the possible predecessors of the levels of the final complex situation. The end of the second step of this investigation will be marked by the rocking of other B2 corresponding to possible predecessors of the levels marked at the end of the first step.

Thus, in the working out of a transformation by the active memory, the possible predecessors of a final situation at a station n, i.e. at the end of n steps of retrograde investigation j¾ are dealt with by the B2s. The successors of the initial set of the initial situation which will be designated step by step in the course of eac ^ phase are dealt with by the bistables Bo. The transfer function from B2 to B2 in the course of each step of retrograde investigation β, or from Bo to Bo in the course of each 3f phase, is assumed by the temporary memories Bl.

The target is posted by rocking the B2 of the corresponding element of CAS. For this, use is made of the lines INT CAS (FIGURE 8). By energising directly the gate 1113 of the ELs corresponding to the complex situation selected at target, a signal is produced at the two lines INT GAS intersecting at the element of CAS from which the search is to start (FIGURE 7). If there is applied a condition P (systematic energisation of the gates i) 1010) , the association gate f 1006 of this element will be verified and will rock its Bl. It suffices to apply simultaneously the condition Tl to rock immediately the bistable B2 desired, and the first search step can be carried out. It should be noted that if one wishes to post as target a point not stored in the CAS (this corresponds to a particular application of the machine) it will be necessary to give in addition the signal of projection TROJ in a manner to energise the gate Ul005.

Now that the origin and the target are put in position, the search itself can commence.

The first search step JJ T2 should rock the Bis of the elements of the CASs from which that marked by its B2 is possible in one step. The conditions to be fulfilled by an element of CAS to be in this condition are :- it must be within the zone of proximity of the element, the B2 of which is rocked (station of proximity 1008 verified); the necessary actions must be memorised at its level in the Cls; these two actions must be associated in the CAA; and the memory (B100 ) of this element of CAS must be rocked.

In addition, to ensure the coherence of the search in the various planes, a Bl should not be rocked unless in all the other CASs in which appears one of the parameters to which it is connected, ^t least one Bl of the same level in accordance with the parameter also possesses the four conditions for rocking.

The actions capable of being brought up again in the course of the first retrograde investigation step are those which terminate at the level of the element of CAS the B2 of which is rocked.

The element of CAS sends this information to the EL via the line RET B2, which comprises a series of gates t/ (1019 or 1020) each energised by a B2. The ELs being at levels at which all the associated CASs have at least one rocked B2 (which is detected by a coherence gate Π 1101 -FIGURE 8) send via their gates A 1102 and an interrogation INT EACI. Every element of CI, whose memory is blocked, which is found on this line corresponds to a possible predecessor and should accordingly interrogate the CAA. For this, the interrogation INT OACI is given systematically at T2 by the ELs of all the levels by the gates UlllO, Πΐ119 and The recording elements (FIGURE 9), whose elementary activity gate A1203 is energised at one and the same time by INT OACI INT EACI and the memory bistable B1201 (through V 1202), send through the gate L/1204- an interrogation INT C A to the CAAs in which the parameter appears. The elements of C A (FIGURE 10) whose memory B1301 is rocked and which are found at the intersection of two energised lines INT CAA, supply via the association gate fH304- authorisation signals AUT CAAp to the levels of the two parameters which have interrogated it (through til305 and 4/1306). The letter p_ which follows AUT CAA gives a reminder that for the CI this authorisation is only partial, as this will not be able to consider that it has AUT CAA until all the CAAs to which it is connected send back an authorisation. This is detected by the coherence gate Π 1401 (FIGURE lib) .

The Els which interrogate and which receive the AUT CM have their authorisation gate f 1205 energised (FIGURE )1 which brings about the transmission of these elements of three signals which travel respectively on the line, the column and the diagonal passing through these elements. AUT 0AQ¾ (through ^ 1206), SORT ACT (through J 1207), and AUT EACI (through y 1208). Only "AUT OACI" meets a verified gate at the time/$T2: the gate 1111 of the EL (FIGURE 8). It brings about through # 13 the transmission of INT CAS to the corresponding levels of the CAS0s in which the parameter appears* In the memorised elements of CAS (FIGURE 7) which receives simultaneously the INT CAS of two parameters, and the proximity condition of which (gate 1008) is fulfilled, the association gate f) 1006 sends a control signal to the bistable B1 1007.

It is still not possible to authorise the definitive rocking of the bistable B1 by this control or ofder signal, since it is not known whether in each of the other CASs associated with the same parameter there is at least one B1 of the the same level receiving a control or order signal. To ensure this verification, us^e is made of a system called self-maintenance.

This system necessitates that the control or order and the RAZ of the bistable B1 act on it in such a manner that in the event of the simultaneous application of these two logically contradictory signals, the output of the bistable B1 gives the logical information "B1 rocked". For this, the signal RAZ B1 cts on the bistable B1 100? (FIGURE 7) through a gate Λ1023 verified by the inverter 11022 when there is no control of B1 by the association gate 01006» This amounts to saying that the output of the bistable B1 reproduces the control or order signal when the RAZ is applied.

Thus, if in the course of the process described above, the RAZ Bl is applied permanently, the outputs of the bistables Bi which receive from their association gate f\ 1006 the control or order signal, will give, via the gates Ul016 and ij 1017 the signals RET Βχ X and RET Βχ Y. Each of these signals will constitute for the EL the indication that at its level one Bl at least of the CAS considered receives its control or order signal. The EL (FIGURE 8) receives a line of RET ¾ from each of the GAS to which its parameter is connected, and these RET Bl arrive at a coherence gate Π 1106, the output signal of which indicates that there is a RET Bl of all the CASs.

It is necessary to rock only the Bl which are located at levels at which at least one Bl in each CAB is controlled, these levels being characterised by a signal at the output of the coherence gate f\ 1106 of the EL. For this it suffices to suppress the INT CAS supplied by the EL whose gate Π 1106 of which has not been verified.

But, on the other hand, the actions placed at the level of the Bl eliminated in this way cannot be raised again by the search signal. It is accordingly necessary to suppress the interrogations which they would send to CAAs, which interrogations are now detrimental, since they are capable of bringing about the transmission to the other parameters of AUT CAAp corresponding to an action associated with that which has been eliminated in the parameter considered.

Finally, it can happen that the centres of assocation of actions or of situations will deliver to the recording centres and connection centres authorisations which are not coherent when they are the object of several interrogations .

An example will enable this to be understood with reference to FIGURE 19. In this FIGURE, there are shown two CAA of an active memory with three parameters A, B and C and five actions per parameter, these CAA associating the actions in accordance with the parameters AB and AC. The elements memorised are represented by crosses and it is assumed that these CAA are the object of interrogations for the actions •^2, -1 and +2 in accordance with the parameter A, -2, -1 and +1 in accordance with the parameter B, and -2,0,+2 in accordance with the parameter C.

It is confirmed that the CAA AB will supply an AUT CAAp for the actions -L and +2 in accordance with A, and -2 and +1 in accordance with B. In the same way, the CAA AC will supply AUT CAAp for the actions -2 and +2 in accordance with A and 0 and +2 in accordance with C, The recording centre allotted to the parameter A will receive oiily the AUT CAA for the action +2 delivered by the coherence gate 1401.

But the CAA AB sends back to the recording centre allotted to the parameter B the possibility of authorising the actions -2 and +1. If it happens that the CAA BC not shown, also sends an AUT CAiip for the action +1 to the recording centre allotted to the parameter B, this will receive the authorisation +1. The state of the CAA AB shows that the action +1 at B is incompatible with the action +2 at A.

One accordingly confirms that it would be possible to send to the recording centres allotted to B non-co-herent authorisations which it would be advisable to suppress. To achieve this, it is necessary to suppress the interrogations CAA relative to the actions -2 -1 in accordance with the parameter A which have not given rise to authorisation.

The three conditions mentioned above are fulfilled by-eliminating the INT OAGI of the ELs (FIGURE 8) whose gate ^1106 has not been validated. Thus, the Els located at this level will no longer interrogate the CAA, and will no longer send AUT OAGI, which will bring about the suppression of the INT CAS.

The system whic effects this suppression is composed of the gates A 1119 and UL120, this latter being the self-maintenance gate. It has been seen above that at the time f T2, the INT OACI was systematic by being controlled through \J1110 by the gate 1119, which is verified by the condition β T2 and through Ull20, by the starting signal A. The output of the coherence gate Λ 1106 is brought to the second input of the gate 1/1120.

Thus, when an INT OACI would have given rise, to the whole logical chain of search in the various centres, to all the returns Bl of its level, the suppression of the starting condition A will not suppress it, since the signal of the gate f\ 1106 will be substituted, via the self maintenance gate ^H20, for the starting signal to maintain the validation of f) III9.

If on the other hand a INT OACI has not given rise to all the RET Bi, it will disappear at the end of the starting, thus suppressing gradually the INT CAAs - AUT CAAs - AUT OACIs -INT CASs and RET Bl to which they gave rise. The Bis whose control is found suppressed are brought back to zero, since the suppression of the control sets up again, by the inverter I 1022 (FIGURE ?) , the validation of Λ 1023 which transmits to them the RAZ Bl. After the short interval of time necessary for these commutations, the RAZ Bl is suppressed, only leaving rocker Bl which fulfils all the conditions. One can accordingly stop the time ^T2.

FIGURE 13 shows active connections in the course of the time T2 when the conditions are obtained for marking a previous point; starting from the B21012 rocked in the CAS shown, through the coherence gate 1101 verified by the other B2s, the gate All02 sends an INT EACI which, with INT OACI validates the gate of elementary act Λ 1203 of the memorised Els, which gate brings about the transmission of the signal INT CAA to the CAAs associated with CI. This interrogation by the intersection of the INT CAA of the other parameter verifies the association gate A 1304 of the element of CAA memorised and supplies an AUT CAAp, which with the other AUT CAAp verifies the coherence gate A 1401 and gives the AUT CAA. This AUT CAA verifies the authorisation gate f\ 1205 of the element which has interrigated and sends the AUT OACI which through /Mill gives the INT CAS which, by the association gate Λ 1006, maintains the rocking of Bl and the prohibition of its RAZ by virtue of the local authorisations (memory CAS and proximity). The RET Bl which result therefrom validate the coherence gate 1106 which through the self-maintenace gate 1/1120 maintains the INT OACI, this latter being at the origin of the logical chain which has just been described. The main element of the preceding circuits are found again in the general interconnection FIGURES 11, lib, 11c.

After this first step β T2, the CASs are found in the following situation: in the B2s there is found recorded the target sought for, in the Bis the points from which this target is accessible in one step. To be able to repeat the same process, it is necessary to mark the points themselves in the B2s. For this, after having given the signal RAZ B2, the co-ordination centre CO will give the signal β Tl which brings about by Λ 1101 (FIGURE 7) the rocking in B2 of the elements of CAS of which the Bl is rocked.

Thus, in the course of successive cycles β (T2 - Tl), one will have the collection of the points from which the target is accessible in 1,2, . ; ,n steps. The search goes on until it gives a collection of intermediate targets one of which is accessible in one step from the actual or present situation.

It will be appreciated that this state will have been reached when, at a time β T2, one rocks among other Bl, that which corresponds to the actual or present situation. This coincidence is detected by the gate A 1018, called END β (FIGURE 7) in the single element of each CAS whose abscissa and ordinate are marked by a Bo (1108) rocked in the ELs. The output of the gate is connected to a gate J 1021 which is connected in a line which serves all the elements of CAS and which is called "END β CAS" of the CAS considered. When the lines END fi of all the CAS are simultaneously energised at the end of the time β T2 the co-ordination centre energised by the gate f\ 1330 arrests the search (FIGURE 11a) . The stopping of the search intervenes only at the end of the time β T2, after the end of the signal RAZ Bl, in such a manner that the Bis which will be returned to zero by reason of non self-maintenance will not bring about an inopportune stopping of the search, FIGURE 15 is a diagram of the signals supplied by the co-ordination centre for a step β, the name of the signals being given in ordinates and the length of the signals representing their duration. It can be seen that the step β comprises five periods numbered in abscissa 1 to 5, the significance of which is as follows :- 1. Starting 2. Breaking down of the non-self maintenance chains 3. Rocking of the Bis whose controls are self maintained and possibly end β 4. Erasure of the old intermediate targets . Rocking of the new intermediate targets Time ~ One is now faced with the following situation : the present or actual situation is marked by the bistables Bo in the ELs, there are a collection of points whose projections in the various planes of CAS are marked by rocked B2s one of which points is accessible in one step from the present or actual situation. The cases in which none or several of these points is accessible will be examined separately.

The object of time ie to select the accessible point. The carrying out of the "step f " consists in marking this point in such a way as to be able to make it as the actual or present position for the following search, and to supply to the exterior either the actions in accordance with each parameter which authorises this passage, or the following value of each parameter.

The actions which authorise this step are those applied to the level of the actual or present situation. They are accordingly to be found in each CI on the line INT O&CI extending from EL, the Bo of which is rocked, On the other hand, as these actions must terminate at a point plotted in all the planes of CAS by the rocked state of its B2s, they must be found on lines INT EACI relating to levels at which at least one B2 is rocked in each CAS. Finally, they should be associated in pairs in all the CAA.

The process is achieved in the following way.

In the EL of the level of the actual or present situation, the Bo controls the INT OACI by means of the gate A 1109 (FIGURE 8) verified by the condition If . In the EL or the ELs found at levels where at least one B2 is rocked in each CAS, the outlet of the gate fMlOl (FIGURE 8) controls the signal INT EACI through the gate A 1104, verified by ¾" and the condition of starting (by (^1120), As at the time of T2, the EI memories which are found energized at the intersection of the line INT OACI and of a line INT EACI send an interrogation to the CAAs which, if they include an interrogated memorised element send back an AUT CAAp. The element or elements of CI which are interrogated and which receive the AUT CAA send back the. signals AUT OACI, SORT ACT and AUT EACI , For the moment, only the signal AUT EACI reaches a gate validated in , the gate A 1112 (FIGURE 8) which through U III3, gives the INT CAS. When, in a CAS there is an intersection of two INT CAS on a memorised element CAS whose B2 is rocked, the gatef\l006 (FIGURE 7) gives a control signal to the bistable Bl.

It still remains to be checked that these control signals of the bistables Bl in the various CASs are coherent, i.e. that they produce themselves in each parameter. Use is ?1 again made of the self-maintenance cyetem. By applying the RAZ Bl permanently, there appears the control signals of the Bis on the lines RET Bl.

The only controls or orddrs of Bl which are valid are those which appear at the level of the ELs of which the coherence gate Λ 1106 (FIGURE 8) of the RET Bl gives a signal. The others should be eliminated. It is accordingly necessary to suppress the INT CAS sent from the ELs whose gates 1106 have not been validated. But on the other hand, the actions whose authorisation one would thus cancel, cannot be utilised at the step 3jf . It is accordingly necessary to suppress the interrogations which they sent to the CAA, as these interrogations would risk causing the transmission to the other pararaeters of an AUT CAA corresponding to an action associated with that which is suppressed in the parameter considered.

To arrive at these two results, it suffices to suppress the INT EACI of the ELs whose gate Π 1106 has not been verified. Thus, the EI located on this line will no longer interrogate the CAA and will no longer send back an AUT EACI, which will bring about the suppression of the INT CAS.

The system which effects this suppression is constituted by the gates Λ 1104 and KJ 1120 (FIGURE 8). It has been seen above that at the time Y the INT EACI was controlled by the coherence gates A 1101 of the RET B2 and 1104 verified by the signal ¾T and tbx starting signal through 1120. When INT EACI would have give rise, through all the logical chain, to all the RET Bl of its level, the suppression of the starting condition A will not suppress it, since the signal of the gate 0 1106 will substitute itself through the gate 1120 for the starting condition to maintain the verification of f\ 1104.

If, on the contrary, an INT EACI has not given rise to all the RET Bl, it will disappear upon starting, thus suppressing gradually the INT CAAs - AUT CAAs - AUT EACIs - INT CASs and EET Bis to which it gave rise, The Bis whose control is found suppressed are returned to zero by the re-establishment of their RAZs which results therefrom. After the short interval of time necessary for these commutations, the RAZ Bl is suppressed; there then remains rocked only the Bl which fulfill all the conditions .

The CI of each parameter supplies a signal on the line SORT ACT corresponding to the action carried out in accordance with the parameter. This signal is sent to the exterior by verification of the gates ft 1408 (FIGURES 11 and 11a) FIGURE 14 represents the active connections in the course of the time 1$ in the case where a single chain remains self-maintaining. The rocked bistable B2 verifies through RET B2p the gate Π 1101, which itself verifies A 1104 whose output brings about INT EACI.

On the other hand, the bistable B0 1108 which represents the starting level verifies the gate Λ 1109 » which controls INT OACI, The intersection of INT OACI with INT EACI on the gate 1203 of a memorised EI brings about INT CAA. As with T2t the the return of all the AUT CAAps brings about by gate ft 1401 the verification of A 1205 of the EI which has interrogated, the SORT ACT, and the AUT EACI, which through , \ 1112 gives INT CAS, which, through ΓΜ006, maintains the rocking of 31 and the suppressions of RAZ Bl, The output of Bl gives RET Blp, which verifies ^1106, the output signal of which, through U 1120, maintains the verification of 1104, after the suppression of the starting A.

When the step has been carried out, there remain to be marked its terminating point as fresh actual or present situation. This is the object of time £.

At first a signal RAZ Bo erases the B0 whicil represented the present or actual situation. To rock those which are found at the level of the terminating point of the step which has just been carried out, it sufficies to provide the signal AUTl at the gate Π 1107 (FIGURE 8). In the ELs of each parameter located at the level where a Bl is rocked in each CAS, the gate ll07, energised by the signal of the coherence gate 1106, rocks the bistable B0 through U1118. A RAZ Bl achieves this sequence which wn ill be called time g. The memory is then ready to carry out a fresh retrograde exploration at the end of which a fresh stepVmay be carried out.

FIGURE 16 illustrates the signals supplied by the co-ordination centre for a normal step ¾f , i.e. at the moment of the signal END β only one complex situation is accessible; these signals define times 1, 2, 3» 4, the significance of which is indicated below : 1. Starting 2. Breaking down of the non self-maintaining chains 3. Checking time of unity of the actions 4. Supplying actions to the exterior End of the Extraction As well as its function of energising the B2s, the posting system of the final situations, shown diagramatically by SAFI in FIGURE 11a, has the function of settint up a connection between the Bo of the level of each final situation and an input of an AND gate FIN EXT placed in the co-ordination centre CC, the output of which gate interrupts the functioning of the latter; in fact, when its output is energised, this signifies that the actual present situation coincides with the final situation and accordingly that the extraction is terminated.

Choice from among; several equivalent transformations In the explanation of time Uf which has been given above, it was taken that at the moment when the signal END β appeared only one complex situation,mocked by its B2s, was accessible. This is the normal and most frequent case.

It is however also possible that at the moment of an END 3 the system is in a state such that none of the situations marked by the B2s corresponds to an accessible complex situation, or on the other hand several complex situations may fulfil this.

The first case can possible appear only if the density of information in each plane is very great; the projections in the planes of the wave fronts which cover again the various paths possible are thus found to pass simultaneously to the actual present situation and bring about a faulty signal END f.

The attempt at step which results therefrom comes to nothing; no RET Bl is produced or at least does not survive starting. The absence of SORT ACT which results from this is detected by the co-ordination centre as is explained below, which deduces from it that the END β was defective and consequently it takes up again the time fi where it had been stopped up to the next signal FIN β .

The case i which several points narked by their B2s are accessible fron the actual present situation is much nore interesting. It occurs each tine the infornation stored in the machine define several equivalent transfornations for connecting an initial situation to a final situation in a minimum number of steps .

If signals of the phase are given at least two chains of elements will remain self-maintaining after the end of the starting. The GIs of one or nore parameters will supply nore than one signal SORT ACT and in one or nore planes several Bl will be narked ae situations resulting fron the step , which is inadmissible. It is accordingly necessary to provide the machine with a system by which in the event of several solutions being possible, one will be chosen arbitrarily. 2. Operation of the process for carrying out the selection.

A sinple process which would consist in selecting arbitrarily an action fron among those which appear each parameter is not applicable; apart from very special cases, all combinations of actions appearing in accordance with the various parameters do not define a possible complex action. On the other hand, it is not a question of reviewing successively all the combinations of possible action in accordance with the various parameters since their number increases very rapidly as a function of the number of parameters and of possible actions in accordance with each parameter (e.g. 25 for two paraneters 5 actions, 15.10^ for 6 parameters with 5 actions, 10 14 for 20 parameters with 5 actions); noreover, this successive review would be contrary to the principle of searching in parallel used in the systen. The principle of choice adopted is the following : the parameters and the actions in each parameter are classed in an arbitrary order called, for convenience, hierarchy for the paraneters and priority for the actions. When in one or nore pararaeters nore than one signal SORT ACT exists after starting, the coordination centre is notified of this by a systen of gates which will be described below. It then installs a priority among the actions of the first parameter in the hierarchy in accordance with which several actions are issued. The principle of locating this priority is the following : the first action in the order of classification which receives an authorisation AUT CAA inhibits the following actions. This inhibition is effected by suppression of the INT CAA, which has the effect of suppressing not only the other inputs AUT CAA which were attributed to the parameter, but also of suppressing the AUT CAA which were returned to the other parameters, and which were not associated in the CAAs with the action which has been selected as a function of the priority.

After the setting up of the priority in accordance with the first parameter which gave several actions, three cases may occur : there is no longer more than a single SORT ACT per parameter and the problem is resolved. This case is found if there are multiple actions only in accordance with the single parameter, or if the choice in accordance with the first parameter has raised the ambiguity in accordance with all the others by the operation of the suppressions AUT CAA; no output action exists. All the self-maintaining chains have fallen back at the entry of the priority on the first parameter giving several actions; (this can only be produced in the case of incoherent recording). The interaction priority is changed in accordance with the paraneter and one starts again the sane nanner as in the following case: there are one or nore other parameters giving several SORT ACT.

The saneprocess is repeated ; priority is set up in accordance with a second paraneter which is now the first giving a nultiple action in the inter paraneter hierarchy. At this nonent a new problem nay be posed: the actions selected in this second paraneter nay not be conpatible with that which has been selected in the first. If it is compatible there are S0R*2 ACTs in accordance with all the parameters, and one can pass to the setting up of the inter action priority in accordance with a third parameter if applicable .

If it is not conpatible, all the self-maintaining chains fall down and there is no longer any §ORT ACT.

The co-ordination centre will then modify, for instance by circular permutation, the interaction priority in the last parameter, then it will nake a fresh attempt giving once again the starting signal. During this new starting tine, and the tine necessary for the falling down of the non-self-naintaining chains, it will provisionally inhibit the circuits if interaction priority, in such a nanner that AUT CAA which would not survive the starting cannot inhibit, by the operation of the .' interaction priority the INT CAA. which themselves would give rise to self-maintained AUT CAA.

If the re-establishment of the priority causes all the self-maintained chains to fall once nore, it is because the priority following the second parameter is still not suitable. The co-ordination centre will modify it again and will nake a fresh attempt.

If on the contrary^ the SORT ACT continues to exist (which will be the situation produced after a number of attempts at the nost equal to the nunber of actions possible in the parameter) one can pass by choice to the following parameter, if necessary.

This process will cone to an end when after the re-establishment of the priorities a self-maintained chain, and one only will continue to exist, defining a specific complex action. It is only then that the co-ordination centre will suppress the RAZ Bl, thus authorising the marking of the terminating point of the action selected and will verify the gates Λ14-08 authorising the outlet of actions to the exterior (FIGURE lib).

The maximum number of tests necessary for determining an action is in the most unfavourable case equal for each parameter to the number of possible actions. This number of tests is always relatively reduced to a value considerably lower than the number of combinations of possible actions : e.g. 10 for 2 parameters with 5 actions, 30 for 6 parameters with 5 actions, 100 for 20 parameters with 5 actions.

The process of choice in case of ambiguity is summarised by the following table as a function of the three possibilities which may arise at the moment of the step "7£ , (b) Description of the circuits representing the choice Interactions priority FIGURE 22 shows the logical diagram of this system which in each variable sets up a priority among the actions.

The connections with three CAA for FIVE actions has "been illustrated, but these numbers are not at all restrictive.

The coherence gate f\ 14-01 has the role of not supplying the AUT CAA to the CI unless all the CAA to which the CI is connected send back an authorisation AUT CA .

The gates Π1 -02 andyi4-03 constitute a supplementary self-maintenance system: after the starting, there will continue to exist only the INT CAA which have given rise to all the AUT CAAp.

It is important to note that on the logical plan this self-maintenance system is redundant in view of that previously described. Its role is to accelerate the breaking down of the non self-maintained chains: if, after starting, one of the AUT CA of an action disappears, by suppression of a INT CAA in another variable , the corresponding INT CAA is immediately suppressed withouts its happening that the chain "AUT CAA - AUT OACI (or EACI) - INT OAS - BET B1 - INT OACI (or EACI) -INT CAA" breaks down so that there is a considerable gain in speed.

The chain of interaction priority is constituted by the sequence of the gates Π 4-04, called classifying gates and gate .^ -05 connection in a looped line.

The classifying gates f 14-04- receive their verification from a control or order centre 2201 composed essentially of a counter and a decoder; in the normal event (time j-j and step ^without need for priority) none of the gates l 14-04· is verified: the invertors I 1406 then verify all the gates 1402, called priority action selection gates, connected to the interrogation lines. When the system 2201 receives the order to put in place the priority MEP, it verifies all the gates 1404 except one.

When an action receives all the AUT O A^, its gate Π 1401 gives a signal which appears at the output of its gate K-l 1405· This signal propages itself through the verified gates /O 404 and the gates U 05 of the following actions until it strikes the only gate ^ 1404 of the chain which is not verified. This signal has the effect of cutting out, by the invertors I 1406, the verification of the gates Π 1402 of the actions located downstream of that which receives all its AUT CAAp.

The action for which the classifying gate Π 1404 is not verified is called "at the head of priority".

Then the counter-decoder 2201 receives an impulse at its input "MOD H" , it puts another action at the head of priority. At the end of a number of impulses equal to the number of actions, all the actions have been found at the head of priority. The use of a looped circuit carrying the gates Π404 U 1405 constitutes a simple but non-restrictive way of achieving the classification sought for, the modification of which is then ensured by circular permutation.

Inter parameter hierarchy It is desirable to describe first and foremost the system which permits the co-ordination centre CO to detect whether the step gives 0, or 1, or more than one complex action (see FIGURE 21 and FIGURE 11a).

Associated with each parameter, a gate of multiple actions (PAM) gives this information which it issues in the form of 0, 1 or > 1 actions.

There is more than one complex action as soon as a parameter gives more than one action. The signal ^ 1 ACT complex is accordingly supplied by the gate 2402 which receives at its inputs the signals of multiple actions of the PAM sent from the outputs SAM of these latter* There is no complex action when action is not issued on any parameter. It has been seen that the self-maintenance system prevents certain parameters giving actions and not others; one cou-L accordingly take as the signal 0 ACT ' complex, the output 0 ACT of any PAM whatsoever. By taking a gate (J 2401 supplied by the outputs 0 ACT of all the PAM, the co-ordination centre will be warned of the absence of complex action as soon as alltthe actions of a variable have fallen down again.

Finally, when there is neither an 0 ACT nor > 1 ACT complex, the gate U 2403 does not give a signal, and the invertor I 2404 gives the indication that there has appeared a complex action, and one only.

It has been seen that in the case of the output of multiple actions the interaction priority is set up for the first variable which presents several actions, the variables being classed in an arbitrary order in accordance with a hierarchy. FIGURE 23 shows the system which esnures the succession of the choice in the different variables, and FIGURE 11a represents a portion of this allotted to a parameter· The succession of the gates j) 305 called classifying gates andfJ 2306 constitutes the interparameter or intervariable chain of hierarchy. The classifying gates 2305 are always verified, except for one. The variable whose gate f\ 2305 is not verified is called "at the head of hierarchy"* The system associated with each variable is composed essentially of: (i) a bistable of hierarchy, designated by BH 2309 the rocking of which represents the fact that the interaction hierarchy of this variable is used; (ii) a set of gates called "gates of multiple actions" ΡΔΓΊ 23OI which supplies to the co-ordination centre the indication that each variable gives 0, 1 or more than one output action SORT ACT. This set, shown in FIGURE 20 for a parameter with 5 actions, has 6 inputs, at which arrive the output actions of the CI of the parameter and two outluts which correspond to the information 0 ACT and more than one complex action ( 1 ACT) If the CI does not send any action, there is no signal at the output of the gateU 901, which through the invertor I 1902 brings about the transmission of the corresponding information. If the CI sends two actions or more, one or several of the gates 903 to 10 which correspond to all the pairs of possible acfions send a signal to the gatetjl913 whose output supplies the information "more than one complex action" ( 1 ACT); and (iii) a bistable called "bistable of multiple actions" BAM 2304 FIGURE 114.

This bistable rocks when several actions in accordance with the parameter continue to exist by self-maintenance. It is returned to zero when there has been obtained a single self-maintained action, the selection of this action being the result of the installation of a priority in accordance with the parameter itself, or in accordance with another.

The gate PAM 2301 controls the rocking of the "bistable BAM 230 by the gate Π 2303 , provided the co-ordination centre CO does not suppress the verification of this gate by giving the signal INH CDE BAM to the invertor I 2302.

The output signal of the bistable BAM 2304- constitutes a verification of the gate f\ 2308, called authorisation of hierarchy of its own parameter, and on the other hand, it affects the inter variable hierarchy chain through the gates U 2306 and fi 2305 of the following variables, up to the classifying gate Π 2305 > not verified, of the variable at the head of hierarchy. This signal, through the invertors I 307 suppresses the verification of the gates Π 2308 of the variables located downstream of which the BAM has energised the hierarchy chain.

When the co-ordination centre sends the signal "AUT TDE BH", this signal has effect only on a single gate of authorisation of hierarchy 2308: the gate of the first variable in the order of hierarchy of which the BAM 2304 is rocked.

No other AND gate of authorisation of hierarchy can be verified unless its memory BAM is not rocked; or it may have its BAM rocked, but it is located downstream of the AND gate considered and up stream of the head of hierarchy, its AND classifying gate bein then verified, and conducting the signal inserted by the BAM up stream of the network considered.

The principle of operation is identical to that of the interaction priority. It is this system which makes it possible to install the interaction priority only in the first variable in accordance with which appear several actions.

When an interaction priority has been found in accordance with the first variable giving a self-maintained action, the co-ordination centre sends the signal RAZ BAM. The BAMS of the variables in accordance with which only a single action issues, (and all the variable already in the hierarchy are in this case are returned to zero. If in accordance with other variables multiple actions issue, their BARM is controlled by their PAM, and it remains rocked, since the play of the invertor I 2014 and of the gate f] 2313 prevents them from being influenced by the action of the signal RAZ BAM, By transmitting again the signal AUT ODE BH, one will rock the BH of the first variable in accordance with which multiple actions continue to exist.

When the BH of a variable is rocked, it controls, through the gate A 23 1 which supplies a signal ΓΙΕΡ to the counter-decoder 220 , the setting up of the interaction priority provided the co-ordination centre does not supply the signal IKH H which suppresses by the invertor I 2310 the verification of the gate 2311.

It has been seen above that the setting up of the priority in accordance with a variable may bring about the breaking down again of all the self-maintained chains. In this case, it is necessary to modify the priority in accordance with this single variable, and start again. It is the gate f ' 2312 which makes it possible to modify the order of interaction priority only in the variable which is the last to have been subjected to the priority.

I fect, it has been seen that AUT CDE BH has the effect of rocking the BH corresponding to the first BAM rocked in the order of the inter variables hierarchy. On the other hand, as soon as one has found a priority which permits a self-maintained chain, the RAZ is undertaken of the BAM, only the BAMs of the variables in accordance with which there are still several actions escaping from the RAZ, which variables, by-definition, can be located only downstream or lower in the chain of the last variable subjected to the interaction priority The variable in accordance with which the setting up of the priority has caused the falling down of all the non self-maintained chains has its bistable BH rocked. On the other hand, its bistable BAM is also rocked, since the RAZ-BAM action is not taken until after there hassbeen found a priority . preserving a self-maintained action.

Since its BAM is still rocked, no BH has yet been able to be rocked downstream, and since its BH has been able to be rocked, no rocked BAM remains upstream. It is accordingly the single variable having its BAM and its BH rocked.

When the co-ordination centre gives the signal "AUT MOD H" , it is the only one whose gate * 2312 will give a signal causing the interaction priority supplied by the counter-decoder 2201 to change. c. Development of a time with choice of a transformation FIGURE 7 , to which reference should be made up to the end of the present explanation on the development of the time j^with intervention of hierarchy circuits, represents the succession of signals supplied by the co-ordination centre to pilot the search of a single action. These signals, like all those which are supplied by the co-ordination centre CC are indicated in FIGURE 11a. The circuits energised under the control of the signals of FIGURE 7 are re-assembled synoptic-ally in FIGURE 11 and are mostly quite clearly visible in FIGURE 11a.

The time (1 ) at which begins the time ^is the first starting. (2) is the falling "back tine of all the non self-maintained chains. (3) is the time during which the co-ordination centre examines the signals which still exist by self-maintenance.

Three cases may be present: Zero complex action: no variable gives action (by reason of the self-maintenance, it is impossible for actions to issue in accordance with certain variables and not in accordance with the others); 1 complex action: all the variables give one action and one only; multiple actions ( * 1 ACT) : one or more variables give more than one action.

Case NO. ACT at (3) of FIGURE 17 No chain of signals has survived the starting. None of the points reached by the retrograde search is accessible from the present or actual situation. The signal END which has given rise to this attempt of step ^was due to a recombination of the projections of the wave fronts.

The co-ordination centre stops the time and takes up again the time ^ up to the next signal END j$ .

Case 1 ACT at (3) of FIGURE 17 This is the normal case: one point, and one only reached by the wave front os accessible from the actual or present situation. A single B1 is controlled or ordered in each CAS. The co-ordination centre raises the RAZ B1 in such a manner as to mark the arrival point of the step, and gives authorisation AUT SORT ACT which permits the CIs to supply to the exterior the actions constituting the step (control of a visual display, control of a system to be carried out · .. and so on).

Case 1 ACT at (3) of FIGURE 17» Several points reached by the wave fronts are accessible in one step from the present or actual situation.

At the time (3) the BAMs of the variables giving several actions are rocked by the corresponding PAM gates. The signal "INH ODE BAM" supplied during the time (1) and (2) has played the part of preventing the rocking of the BAMs of the variables in accordance with which several actions have issued at the moment of the starting, but only one of which has continued to exist by self-maintenance.

The co-ordination centre then gives the time (4) and (5) of FIGURE 17. At the time (4-), the signal "AUT CDE BH" brings about the rocking of the bistable BH of the first variable whose BiM is rocked. In accordance with this variable, only the first action in the order of the interaction priority is checked, the others are blocked or inhibited by suppression of their interrogations CAA. The results of this is, by the operation of the suppressions AUT CAA, the falling down of chains of signals which are no longer self-maintained by reason of the fact of the suppression of one of their links. The time (5) is a dead time which allows these commutations« At the time (6) the co-ordination centre may again find itself faced with the three possibilities 0, 1 or 1 A action. These three possibilities will be examined in a different order for convenience of explanation. 1 ACT at (6) of FIGURE 17 The setting up of the priority in accordance with this single variable has sufficed to select a single complex action. One can then carry out the step Vwhich the co-ordination centre controls as previously by the time (13)· The priority which has been described as set up in accordance with the variable is suitable, but there remain downstream, or lower down in the chain, one or more variables giving several actions. The co-ordination centre gives the time (12) in the course of which the signal RAZ BAM returns to zero or confirms at zero all the ΒΔΜ (FIGURE 11a) except those of the variables or variables PAMs of which still give a control signal of the BAM. One then returns to the time (4) where the signal **AUT CDE BH" rocks the BH of this variable, or of the first of these variables. After the time (5) one arrives at a new time (6) which may have the same three possibilities. 0 ACT at (6) The falling back of all the self-maintained chains indicates that the state of the priority in the variable which has just been subjected to the priority is not suitable. It is necessary to modify the prioritt then re-start, but taking certain precautions. This is the role of the time (7) to ( 11 ) .

At (7) the signal "AUT MOD H" allows the gate 2312 (PIGUEE 11a) of the single variable of which the BAM and the BH are simultaneously rocked to give a signal "MOD H" to the counter- decoder 2201. This signal changes the action at head of priority.

At (8) one re-starts all the chains. At (9) all the chains not self-maintained fall back. The role of the signal "INH H" of the times (8) and (9) is to suppress by the invertor I 23 0 the verification of all the gates 2311 which order the counter-decoders 220 , by the signal "put in place MEP" , to put in position the interaction priority. This has the aim of preventing an action which will be eliminated by the sole operation of the self-maintenance from preventing, "by operation of the priority, a valid action. At the time (10) the interaction priority is set up again in all the variables the BH of which is rocked, and all the chains corresponding to suppressed "INT CM" fall back. One arrives at a time (11) at which time the co-ordination centre may again be faced with the same three possibilities: 0, 1 or » 1 A action, to which it replies as at (6): 1 ACT: one passes to the time (13) to carry out the step : ^> 1 ACT: there still remains one or more variables giving several actions, which it is then necessary to submit to the priority in their turn: one passes at (12), then at (4); 0 ACT: the amended or modified priority is still not suitable. One returns to (7) to modify it again, then makes a fresh attempt.

As has been seen, the maximum number of re-startings per parameter is that of the actions possible in this parameter. The maximum number of trials will be equal to the sum of the number of actions of the parameters and not to their number of combinations· The co-ordination centre is a system of gates, ofbistables and other logical elements which, as a function of the signals which it receives (lines END signals of the PAM and so on), supplies sequences of signals adapted to each of the times.

This system is constituted with well known means which are standard in logical circuits. (d) Gate of zero complex action (PAGN) : (see FIGUE 11a) A gate called a gate of zero complex action PACN is intended to prevent the blocking of the memory in certain particular cases of multiple complex actions. If the various complex actions possible in one step are such that in accordance with all the parameters the action 0 continues to exist — , priority would terminate (if the OAAs authorise it) in the choice of this action 0 in accordance with all the parameters, whereby there would be a resultant situation of the step identical to the actual or present situation. This sane zero step will be repeated indefinitely.

The lines SORT ACT of action 0 in accordance with all the parameters converge on this gate PACN (see FIGURE 11a) which is a simple AND gate whose output energises the gate IJ2401 and inhibits the output of the gate U2402, thus creating for the coordination centre CC a simulation of the absence of an output of action, which then brings about a modification of the interaction priority. The same cycle will be repeated until a complex action has been found which comprises a non-zero action in accordance with at least one parameter, (e) Classifying of possible interactions It has been seen that the classifying of actions for a possible choice is purely arbitrary, the only important thing is that after a number of trials equal to the number of actions, all the actions should have been found at head of priority.

When the problem to be solved is a purely theoretical one, the order of classification can be any order.

If the active memory is used for piloting or controlling a material system, a certain type of classification may be found to be of greater interest than another as the function of the characteristics of this material system.

Two types of classifying are explained below, though not restrictively: Action 0 at the head The actions are classed in order of increasing amplitude: for instance 0, +1, -1, +2, -2. In the case where several steps are possible, the memory selects the step the component of which in accordance with the parameter will be of minimum amplitude. This in effect means deciding between two solutions in accordance with the law of least effort. For instance, this can be interesting in the control of a chemical process: if the parameter represent' ing the temperature is thus put in a hierarchy, the solution selected will be that having the minium of variations of temperature resulting in a minium energy outlay. To put this process in operation, at the end of each step ^t e return to 0 at head is ordered by the counter-decoder 2201.

Priority. as a function of the preceding step At each step, the action placed at the head of priority is that which has been ordered at the preceding ∑fcep which has or has not necessitated a choice. Then come the actions the amplitude of which differs by 1 from that of the action at head, then by 2 and so on.

To give an example: this classification will be of interest for the control of a mechanical system having great inertia: the solution selected will be than having the smallest variations of speed resulting in a minimum energy outlay.

To realise this priority, the action which has just issued at the end of each step $ is brought to the head of priority. This may be done either by the counter-decoder 2201 the bistables of which are connected to the lines SORT ACT BXT (FIGURE 11b) by an operation of an OR gate forming a coder or by replacing the counter decoder 2201 by a set of five bistables each allotted to one of the five actions. The output of each of these bistables determines the action at the head, when it is energised. The input of each bistable is connected to the line SORT ACT EXT corresponding in such a way that it will be rocked at the end of the step ywhen the action has effectively issued. These five bistables form part of a shift register for changing the priority under the action of the signal MOD H.

Auxiliary functions and various uses of the active memory The basic function of the machine which has been described is to enable the determination to be made of a transformation connecting an initial complex situation to a final complex situation in a minimum number of steps and in the case where several such transformations exist, to select one of them. It is possible to enlarge the field of possibilities of this machine by the utilisations of auxiliary functions some of which will now be described, though in no restrictive sense.

Generalisation It has been seen that the elements of the recording centres (FIGURE 9) each included a gate { 1202 located at the output of the memory B1201 and comprising an input capable of being energised by a generalisation line GEN common to the entire recording centre. The energisation of the input GEN simulates the storage of the element.

Nevertheless, all the elements of the recording centres do not by that become active. In fact, the only ones capable of supplying the authorisations OGAGI EACI are those which are concerned with an action stored elsewhere in the centre or centres of association of actions. The energisation of the line GEN thus brings about the generalised trial at all the levels of the actions learnt at a determined level.

Putting certain associations out of service FIGURE 7 showing the constitution of an element of CAS shows that there is at the outlet of the memory 1004- of this elenent an or gate receiving at one of its inputs a line of projection comnon to the entire CAS. The same is true for the element of CAA shown in FIGURE 10. The energisation of a projection line of CAS or of CAA has the effect of simulating the storage of all the elements of the centre considered. All the elements of association interrogated simultaneously in accordance with two parameters will accordingly send "back authorisations, which amounts to suppressing the constraints recorded in the centre considered.

In a general way, one can suppress any constraint connected to at least one authorisation line in accordance with a parameter, by feeding a signal to this line when the corresponding interrogation line is energised, which means in effect that the said authorisation is simulated. It is possible in particular to simulate such authorisations at all the levels of a parameter in one or more CAS or CAA where this parameter intervenes, without suppressing corresponding constraints for the other parameters in this same centre.

Putting a parameter out of service It is possible to deal with certain problems by totally removing a parameter. This is carried out for instance by effecting simultaneously, by the passing of signals to the corresponding lines: the simulation of the end *ζ*> for this parameter, the simulation of the end of extraction for this parameter, the simulation of the output of action 0 in accordance with this parameter on the gate of zero complex action PACN (FIGURE 11a), and the energisation of the projection lines PROJ of all the centres of association where this parameter appears (FIGURE 7 and 10).

Abstraction With the machine it is possible to effect the removal of at least one parameter in the definition either of the final complex situation or of the initial complex situation, for instance, or of the two situations without having to effect removal of the same parameters from both.

The removal of a parameter in the final complex situation is effected by posting as a final situation in accordance xith this parameter all the levels of this parameter. The removal of this parameter in the initial complex situation is effected by memorising all the BQ of the connecting elements allotted to this parameter.

Cycles When the output of the gate of end of extraction END EXT (FIGURE 11a) is blocked, the determination of the transformation does not stop when the actual or present complex situation coincides with the final situation. The machine continues to search among the possible transformations for the transformation which enables the connection to be made in the minimum of steps, of the actual or present situation to the final situation, and thus determines if it exists, a looped transfornatioii starting from the final situation to return there; the machine accordingly functions in cycles.

Re-looping When one of the parameters of several of then consist of values, such as angles, the variation of which is cyclic, it is possible to take this property of the parameter into account by virtue of a special arrangement of the recording centres; this arrangement is moreover capable of being given other applications; In FIGURE 24 there are shown a recording centre and a connection centre analogous t'o the CI Y and CL Y of FIGURE 3 fo one parameter with 12 levels and 5 actions for each, level. The discontinuity between the levels 1 and 12 is suppressed, taking that the level 1 is the end of the action +1 at the level 12, that the level 2 is the end of the action +2 at the level 12 and so on. This is effected by connecting suitably the lines EACI starting from the levels considered. Accordingly for instance the line EACI starting from the connection element of level 1 is connected on the one hand to the recording elements relating to actions 0 at 1,-1 at 2, and -2 at 3 and on the other hand +1 at 12 and +2 at 11.

For the various topological structures one can or might imagine other types of re-looping.

Determination of equivalent solutions There is at the output of the bistables of hierarchy BH an OR which is not shown, the output of which is capable on in external order being received of controlling or ordering the blocking of tine . This blocking permits, whe i there are' severl equivalent paths started, of the no ifications of the hierarchy on the activity which is issuing from the machine and the determination of various equivalent solutions.

Other possible methods of realisation It is possible to imagine variations, in accordance with the nature of the problem which is being dealt with, using the active memory previously described, thus increasing these possibilities.

Some of these possibilities will be examined by way of example.

Recording centre with any actions whatsoever The connections between EL and EI which have been described above corresponding to a systematic structure in which the Els of each level represent actions terminating at adjacent levels, the possible actions being the same at all the levels. This systematic arrangement of the Els of each level is translated by the oblique arrangement of the lines INT and AUT EAGI (See FIGURE 11).

It is quite possible to imagine a GI the lines EACI of which would permit an EI of any level to represent an action effecting arrival at any other level.

One can in this manner construct any netx^ork whatsoever. It suffices to set up a two-way arbitrary relation between the nodes of the network and the levels of an active memory to be able to determine the links which the EI of each of the levels of this memory should represent.

For instance, FIGURE 25 shows a network of vectors. With each of the nodes of this network, a level of the active nenory is associated in the manner shown in FIGURE 26. Each of the links of the network is represented by a EI of the active memory: for instance: the action +1 or the level 1 is the image of the vector passing from the node 1 to the node 2, the action -4 of the level of 5 that of the vector passing from the node to the node 1 and so on.

Consequently, if one considers from a general view point the machine for the extraction of transformations which has "been described in application to an active memory, the machine enables the simultaneous searching in several networks of paths of optimum components in connection with the constraints of interdependence among these networks, these paths in each network connecting a starting point node and a target point node.

The set of the starting points characterises an initial complex situation and the set of the target points characterises a final complex situation. Each step of a transformation connecting the initial complex situation to the final complex situation comprises the passage from one node to an adjacent node in one at least of the networks, the set of the nodes reached at the end of a step constituting an intermediate situation. In each network, the optimum component path is defined as that which enables this transformation to be operated in the minimum number of steps.

If in one network at least, there are several equivalent optinua component paths, the machine will select one of them when at the end of a retrograde investigation ^> it will have detected several eleaentary activities in this network. This determination may be effected by setting up, as one does for the parameters, a hierarchical classification among the networks, and by establishing in each of these networks a priority among the elementary activities detected. This priority will apply to the elements of activities capable of transnitting whether these elements are constituted by the end node of the act detected or by the link permitting access thereto; in the latter case the interacts priority is an interlinks priority.

Thus, everythingthat has been described for an active memory putting in operation situations and actions in accordance with each parameter is valid for an extraction machine putting in operation the nodes and the links in a network. The connecting elements are then allotted to nodes instead of the situations, and as such, are called node-elements; the elements of the recording centre allotted to links instead of to tied actions are called link-elements, the connections EACI and OACI between these elements remaining identical. Thus, the elements and the types of lines EACI and OACI represents the network of FIGURE 25 broken down in accordance with FIGURE 26, are illustrated in FIGURE 27. It is important to note the possibility of introducing in the recording centre link- element, not shown, corresponding for each node to the zero-link (in the sane way that the active memory comprises Els allotted to the zero action at each level) .

These link-elements enable the optimum component path to remain at the same node for several steps.

The centres of association of situations CAS become in an analogous manner centre of association of nodes and represent the interdependence constraints existing between the nodes of the networks. Certain interdependence constraints between the networks may also concern the links. If they concern these links as a function of the equivalents of the vectors which they carry, i.e. if they are related to what one will call the free links by analogy with the free vectors, the centres of association of free links take the place of the CAAs with the same function. It should be noted that in the case illustrated by FIGURES 25, 26 and 27, one considers the equivalents of the vectors which carry the links not in the geometrical figure of the network itself but after having affected a different level at each node of the network, i.e. after having effected the breakdown thereof in accordance with FIGURE 26. A free link in this example is accordingly defined by the difference between the levels of an end node and a node of origin and by its direction. The output of the information relating to the activity accomplished in the course of a step of the transformation is carried out on the lines SORT ACT allotted to each network, this information being able to concern either the end node of the accomplished activity or the link enabling access to be made thereto. If this information relates to free links, the lines SORT ACT are connected in an identical manner to those of the active memory shown for instance in FIGURE 11.

The gate U 1008, called gate of proximity, in each element of centre of association of nodes (FIGURE 7) > is connected to the output of the temporary memories Bg of at least some of the elenents of association of nodes accessible in one step in their respective networks from nodes associated by the element considered. Finally, in the hierarchy circuits the output of several elementary activities in in a network is detected by a gate of multiple acts PAM; one can, as with the active memory previously described, set up an interacts priority by acting on the free links; one intervenes on the interrogations relating to these free links to select a priority free link in the network, having its bistable BAM rocked, encountered first in the inter network hierarchy.

Concerning finally the construction of the networks, one can use an active memory the lines INT and AUT EACI of which are connected together in a fixed manner, but are provided for instance on a programming matrix; one can thus realise at will the image of any network of vectors. This really means that the Els are made common.

Connection centre with weighted levels A weighted level of a parameter will be taken as a level having, for the theoretical point of the state of the system in accordance with, this parameter, the obligation to halt for a certain number of steps in accordance with this parameter, the number of steps being the weight of the level. In a network, reference will be made to weighted nodes without changing the significance of the above statement. Of course, the wave front ^ will have to make an equal number of steps to clear this level.

The principle of this weighting is the utilisation in an EL of the weighted level of two shift registers (one for , one for ) having the purpose of preventing the corresponding message from being re-issued from the EL less than a certain number of steps after having reached it.

This constraint is obtained at by forcing the message to halt on the spot by suppressing the INT EACI (at of the INT OAGIs) relative to Els other than that of the action 0; to this latter one sends the generalisation signal. One also sends the projection signal to the elenents of the OAAs corresponding to the action 0 in accordance with this parameter.

If the EI 0 is not stored, a signal is transmitted from the level at the end of a time equal to its weight. If it is stored one may remain there for a period greater than its weight.

The operation of the weighting system necessitates a disassociation of the interrogations and authorisations furnished by the EI of the action 0, from those of the other Els.

In the text dealing with the system of weighting, the following abbreviations will be used: INT OACI = 0 interrogation origin of action, to. the exclusion of that of the EIO INT EACI ^έ=0: interrogation end of action, to the exclusion of that of the EIO AUT OACI authorisation origin of action to the exclusion of that of the EIO AUT EACI =^0: authorisation end of action, to the exclusion of that of the EIO INT OACIO: interrogation origin of action of the EIO INT EACIO: interrogation end of action of the EIO AUT AGIO authorisation of action of EIO (this authorisation is valid as origin and end) Figure 28 shows the modifications undergone by an EL to represent a weighted level. The logical elements which existed already in the EL are designated by the same references as in Figure 8. The logical elements whose role is not modified by the fact that the EL represent a weighted level have not been reproduced (the indications in the Figure correspond to a weight of 4).

Operation at tine ^¾ The reaching of a level by a search wavefront ^ is translated at time β T2 by a signal AUT OACI 0. This AUT OACI 0 causes as previously, through O 2619, Q 1111 and t 1113 an INT CAS, Moreover, through the gate 2608, it rocks the first element of a shift register 2604.0 2608 is not verified until the end ^ T2, after disappearance of the RAZ Bl in such a manner that an AUT OACI 0 which would drop hack again after the starting dies not permit any message to enter the register.

The clock signal of the register 2604 is constituted by the signal <β Tl. At the following time ^ T2 it is the element No. 2 of the shift register which will he rocked. Through the gates, \J 2605, O 2606 and 2607, it sends a generalisation message to the EI 0, and the corresponding projections CAAs.

On the other hand, the element 5 of the register not being rocked, the gate 2603 is not verified and this level at this time T2 will send only the interrogation INT EACTO, and will not accordingly he able to rebound its message to other levels. The sole signal which can come back as a result of this INT EACIO is an AUT AGIO x^hich through O 2619, 1111 and U1113 causes the transmission of the INT CAS. Moreover, if the EIO is stored, the gate O 2610 is verified and the AUT AGIO causes at the end of ^ T2 a new rocking of the element 1 of the register 2604.

The following two periods ^ T2 can give only the same result (unless other centres of the machine refuse the AUT or RET necessary): the elements 3, then of the register act like the element 2.

At the time T2 after, the element 5 of the register 2604 is rocked.

The gate O 2603 being verified, the returned B2 controls through O 1101, f) 1102 and U 2601 and U 2602 the INT EACIO and EACI 0, the reunion of which is equivalent to the INT ACI of the initial system.

One has accordingly held the message ^ at this level for a certain number of steps equal to its weight, while permitting the progress of the message in accordance with the other parameters by virtue of the operation of the generalisation at the EIO and the corresponding projections CAAs.

Functioning at V This is symmetrical to that at ^ , slightly simplified by the fact of the unique nature of the message .

The arrival of a message Y at a level is represented by a AUT EACI 0. This AUT brings about normally through i) 2620, 01112 and O 1113, the INT CAS. Moreover, from the moment when the target of the step *¾} is fixed (after possible intervention of the hierarchy), it rocks the first element of the shift register 2617 ^y the gate 02618 verified by AUT SORT ACT.

During the following three steps, the elements 2, 3 then 4- of the register 2617 are rocked and through the gate U 2615 and the invertor I 2616 stop the verification of the gate O 261 f Thus the B0 at ¥ through O 1109 will bring about only the energisation of the INT OAGIO. Moreover, O 2615 brings about through 02611 and O 2607 the sending of the generalisation to the EIO and the corresponding projections of CAAs.

At the following ¾ step, the element of the register 2617 is brought to 0 and the B0 again brings about the INT OACIO and OACI 0, the reunion of which is equivalent to INT OACI of the initial system, and one can then re-start fron the level.

When the message has "been located for a certain number of steps at a weighted level, it is necessary for the end signal ^ to be produced only when the wavefront ^ has been at this level for a complementary number of steps.

For this reason, the EL of the weighted level verifies the signal given by the end lines ^ of the GASs with which its parameter is associated when the signal has carried out at the weighted level a number of steps complementary to that effected by the signal .

This system, omitted from Figure 27 for clarity is sho*m in Figure 29. It should not function unless the weighted level is effectively occupied by the theoretical point, and has been so occupied for a number of steps less than the weight; whence the invertor I 2702 which gives systematically through 2701 , an AUT END when none of the elements 2, 3 and 4- of the system is rocked.

When the theoretical point has been located at the level for a number of steps less than the weight, one of the elements, 2, 3 or is rocked. The gate U 2615 cuts by I 2702 the systematic AUT END ^ . For the AUT END to reappear, it is necessary for the message ^> to reach the element of the register ^ located facing the rocked element of the register . One of the gates 02703 , 270 or 2705 will then give the AUT END through U 2701.

In practice this end authorisation ^ supplied by this circuit is sent to the co-ordination centre for which it will constitute a supplementary condition of stopping of the tine ^> .

Finally, in the sane way as has been described for the weighted levels or nodes, one can take into account in the recording centre weighted actions, or weighted links, by using shift registers, in the elenents of the recording centre, for delaying the accomplishment of an action (or the freeing of a link) by a certain number of steps.

.Connecting elements with multiple Bp bistaMes It is possible by means of the machine to control the development of several systems. For this it suffices to arrange in the connection element as many bistables Bo 1008 (Figure 8) as there are systeras to be controlled, each set of BQ being allotted to a system of which it represents the actual or present situation.

Each of these B0 sends to CAS a message INF B0 supplying an end gate ^ 1018 (Figure 7) allotted to the corresponding system. Each set of end gates supplies a line END ^> of the CAS, which line is also allotted to the corresponding system. Finally, the coordination centre includes one general end gate ^> 0 1530 (Figure 11a) per system.

The retrograde search is effected as before, with the difference that for each signal END ^ given by the operation of gates of a system, the search is suspended to control the step ¾ of this system. It is then continued until the next signal FIN ^ which will enable the step ¾ of another system, to be controlled and so on until all the systems have carried out their X ; in each connection element the circuits allotted to each Bo are verified by the co-ordination centre each in turn by lines VAL, numbered from I, II to N, if N is the number of systems controlled (Figures 30 and 31) . The search time is not increased at all, since it is always equal to that which would be necessary if only the most delayed system were taken into account.

It is also possible to control several systems, even if the target point is not the same for all of them. It suffices to recommence the search from each target point, each of these searches enabling control to be effected of the advancement of the systems having this target point. Of course there results from this an increase in a number of search steps, but this is not an inconvenience since the rapidity of the search principle is such that one can take advantage of the time expended by each of the systems for effecting its step ^ for following the searches relative to the other systems.

Figure 30 shows the supplementary gates and bistables which should include the connecting element for the control of N systems (designated by I, II and so on) and Figure 31 shows the supplemental gates of the element of CAS.

Absence of the condition of proximity When in solving certain types of problems there is no need for the condition of proximity, represented in the CASs through the OR gate 1008 (Figure 7) and by the connection of its output to one of the inputs of the AND gates of association, one can suitably conduct the extraction process by simulating the systematic energisation of the output of this gate by a signal at the gate U 1010 of the EASs (see Figure 7) · One can also arrive at this by placing the pairs of bistables Bi and B2 not in the elements of CAS, but in the connection elements. There results from this a decrease in the number of pairs Βχ - B2 and a simplification of the machine, the constitution of which nevertheless remain identical in principle: there is a line RET Bi and a line RET B2 in the interior of each connection element; a single coherence gate through EL receives the outputs of all the gates of association 1206 place at the same level in all the TASs where this parameter intervenes. The gates END ^> are placed in the ELs. A pair Bl and B2 being common to all the elements of the same level in the CASs, it may happen that certain B2 are rocked in the course of the search ^> which do not correspond to situations associated in the CAS and satisfying the condition of proximity; in certain cases, this phenomenon is not to be feared, for it may be desired and utilised for the purposes of research.

Elements of CAS with specific functions A system of information processing, more or less complex, may be allotted to each element of CAS. This system, is intended to function at the moment when the element of CAS to which it is allotted is effectively-energised. The result of the processing of information just carried out by a specific auxiliary nenber from a point of CAS nay possibly, but not necessarily, intervene in the development of the scanning of the active memory, for instance, by intervening on the progress of the steps ^> and .

Elements with several memories In the active memory which has been described, each element comprises a memory bistable the rocking of which indicates that the association or the action which it represents is authorised.

When the processing of a problem has been concluded it is necessary to erase all these memories, then to perform the whole sequence of recording of the data of the following programme before one is able to process this problem. This represents a dead time during which the machine cannot be used. Moreover, the rapidity of the search in extraction would make it possible to control in real time several systems simultaneously, i.e. to send to each of them orders of action of a step as soon as the preceding step has been carried out. Unfortunately, this implies the necessity for rerecording the constraints of each system at each step.

To overcome this disadvantage, an active memory is provided each element of which has several memories, in which one can record the constraints of the various systems to be controlled and the research is carried out "by verifying the set of the memories corresponding to the system which the following order requires. Figure 32 sho s the diagram of the set which replaces the memory of each element.

The gate O 2001 is the storage gate which existed previously in the element ( O 1001 the element of association of situations EAS, O 1209 in the recording element EI, 1302 in the element of association of actions EAA) .

By giving the verifications of recording VI, 1 2.. .. one will rock, "by the gates O 2010 , 2011 ... the memory bistables 2020, 2021 .... In extraction it will suffice to verify one of the gates 0 2030, 2031 .... by giving the verifications of extraction VE 1, 2 .... in order that the constraints taken into consideration should be those of a determined system. The gate j 2003 is the output gate of the memory which already exists in the elements and which receives the projection signal ( O1005 of EAS, Ί303 of EAA) or of generalisation ( U 1202 of EI).

As has been seen at the end of the section on recording, the recording and extraction circuits are totally independent. It will accordingly be possible to record the constraints corresponding to a problem in a set of memories (by certain verification of recording VI) while the machine will be operating in extraction by exploiting another set of memories (by another verification of extraction VA) .

Taking successions of actions into account Up to the present an active memory has been described comprising at one and the sane time centres of association of situation and of centres of association of actions. In accordance with the nature of the uses to which the machine is put, one may have need only for one of these categories of centres of association. One may also have other categories enabling the representation of other types of constraints existing anong these paraneters or anong the networks.

Figure 33 shows diagraronatically a nenory having two paraneters the outputs of the recording centre of which towards the CAA are connected not directly to a CAA but to the inputs of a second active nenory conprising as nany levels per paraneter as there are possible actions in the first active nenory. The centre of association of situations CAS1 of the second active nenory plays the role of a CAA for the first.

The recording centres CI1 and the centre of association of actions CAA' of the second active nenory nake it possible to nenorise constraints concerning the succession of actions in accordance with each of the paraneters. This nay be of interest in the control of a noving object for instance to prevent according to one paraneter the rough passage of an action +2 to an action -2 in acconplishing two successive steps. More precisely, the CI' nake it possible to store for each action one or nore possible nodifications of this action in the course of the next step; the CAA' establishes supplenentary constraints anong the nodifications authorised in accordance with the various paraneters.

There should not be seen in the necessarily restricted description given above any linitation of the carrying out of the informative processes defined above or of the construction of the nachines which apply the principle of the invention either in their nenory portion, properly speaking, or in their portion intended for the extraction of coherent infomation, nor finally in the auxiliary functions which one can allocate to then or the diverse and various uses to which they nay be put. 33006/2

Claims (1)

1. CLAIMS 1, Apparatus for the extraction of information for use with data processing apparatus which includes matrices having bistable elements, and temporary memories; a coordination center controlling the bistable matrices and the temporary memories, said apparatus analysing an external system defined by a plurality of parameters each capable of taking a finite number of values and to undergo* starting from each said value, a finite numbor of variations, the data processing machine comprising: I· A pluralit of basic, functionally non-subdividable sub-assemblies including (a) as many connection centers as there are parameters to be memorized, each connection center comprising as many connection elements as there are possible values for the parameter to be considered, each connection element comprising a first separatebis able memorization element} (b) as many bi-di ensional recording center matrices as there are parameters, each recording center comprising recording elements included in the recording center matrices, each recording element comprising a separate second bistable memorization element, each state of said second bistable memorization element correaponding to one of the possible variations of one of the values of the parameter of the respective matrix? a first AND gate, the output from the second bistable memorisation element forming one input to said first AND gate; (c) at least one value-associativw matrix comprising as many association elements as the number of possible associations, and having third bistable memorization* elements, capable of having 1 33006/2 two values, each one corresponding to a different parameter, and fourth and fifth bistable memorization elements and a second AND gate* said fourth and fifth bistable elements being connected to said second AND gate; 11« extraction apparatus comprising (a) a first group of four types of interconnectin lines, interconnecting the connecting elements with respect to a parameter, to the recording elements with respect to the same said parameter, said four types of lines including: (1) a first type of said lines interconnecting the output from a first OR gate of a connectin element to the firs input of said first AHD gate of a row of recording elements associated with one of said values; (2) second types of lines interconnecting the output Of a second OR gate from a recording element to the first input o a third AND gate of a corresponding connecting element, the output of which i connected to an input of a fourth HD gate; (3) third types of lines interconnecting the output of a third OR gate of a connecting element and corresponding to partlcitl value of a parameter, to the second inputs of said first AHD gates of the recording elements so that the variation o a value o the parameter corresponding to the columns in which each recording element is arranged defines the same extreme value for the array of recording elements connected to the same line of said third type and said extreme value is that of said connecting element, the input of said third OR gate being connected to the outputs of fifth and sixth AND gates; (4) fourth types of lines interconnecting the outputs of fourth OR gates of the recording elements to a first 33006/2 Input of a sevenh AJKD gate of a corresponding connecting element; (b) recording lines interconnecting eighth AND gates of the recording elements suoh that each of said recording lines corresponds, for the same volumn of a recording matrix, to the same variation controlling the actual value of the parameter; (o) the extraction apparatus furthe including said value-associative elements and a second group of three types of interconnecting lines, interconnecting the connecting elements eaoh, vith respect to a value of a parameter to at least a row of value-associative elements with respect to the same value of a parameter including: (1) fifth types of lines interconnecting the outputs of said buffer OR gate of a connecting element to at least one of two inputs of ninth AHD gates of a row of associative elements, a group of associative elements forming an association center, the center of association formed by said group of elements being associated with a predetermined value with respeot to said parameter, the outputs of said ninth AHD gates being connected to one input of said fourth bistable elements and to the input of an inverter; (2) at least two sixth types of lines for each center of association associated with a predetermined value* having at least two fifth and sixth OH gates eaoh associated with at least two rows of at least one center of association associated with said predetermined value, for eaoh parameter, each row of elements being connected to an input of the ninth AND gate of the connecting element corresponding to the f 33006/2 center of association of the same predetermined value having at least tvo seventh and eighth OR gates, each aesooiated with at least two rows of at least one center of association of said predetermined value, for each parameter, each row of elements being connected to an input of a tenth AMD gate of the connecting element corresponding to the value of the parameter defined by said ro j (d) as many display lines of the values for the group of parameters corresponding to the final state of the system to be controlled, as are possible values for each parameter, each said lines being connected to an input of the buffer OR gate of a connecting element which corresponds to the same value of the same parameter; (e) as many display lines of the values for the group of parameters corresponding to the initial state of the system to be controlled as are possible values for each parameter, each said line being connected to an input of a ninth OR gate of the connecting element which corresponds to the same value of the same parameters (f) the coordination center executing, step by step* the different phases of search, comprising: (1) lines Y connected to a second input of fourth AND gates and said sixth AND gates of the connecting elements; (2) start lines connected to the inputs of tenth gates of all the connecting elements; (3) control lines connected to all eleventh AND gates of the value assoolation elements; - 137 * 33006/2 (4) an eighth line connected to all the first inputs of twelfth ASS gates, the other second inputs of which being connected to all of said recording lines of the same column of recording elements in a recording matrix; (5) ninth lines connected tot * one input of said fifth AND gates* said third AND gates and pair of thirteenth ARB gates of all the connecting elements, and - one input of fourteenth AND gates of all the association of value elementsf (6) tenth lines connected to one input of all the second AMD gates of all the asaooiationof value elemental (7) further control lines connected to one input of the fifth bistable memory element of all the association of value elements! (8) eleventh lines connec ed to the output of an eleventh OR gate, one each being associated with a center of valu association and connected, in turn, to the inputs of fifteenth AND gates} (9) twelfth lines and a comparator and a sixteenth AND gate, the twelfth lines being connected to' the input of the comparator* the output thereof being connected to said sixteenth AND gate and interrupting the extraction step; and (10) a clock means, said clock providing timing signals, one of said timing signals providing a signal to the ouput of said fifteenth AND gate and then, providing further timing signals to be followed by said first timing 33006/2 further generation of clock signals* 2 1 •4-bb Apparatus according to claim -© wherein: I· said machine comprises a fourth sub-assembly, said forth sub-assembly including at least one matrix formed of elements of variable association of values, said elements of variable association of values including six bistable memorization elements, each corresponding to an association of at least two variations of value, each associated with a different parameter; and wherein the extraction apparatus further comprisesi II» a thirteenth type line interconnecting the output of a twelfth OR gate with all the recording elements of a column to one of the inputs of a seventeenth AND gate of all the elements of variable association of value of a row, of at least one of the matrices; and fourteenth type lines connected to the outputs of thirteenth and fourteenth OR gates, all said fourteenth type lines of one row of a center of a ssooiation being connected to an input of an eighteenth AND gate of all the recording elements of a column of the recording matrix, the other input of said eighteenth AND gates being interconnected to the output of said first AND gate, the output of said first AND gate being connected to one input of said second OR gate* 3 1 42· Apparatus according to Claim 40, wherein each of the elements of association comprises a fifteenth OR gate connected to the output of said fifth bistable memory elements of at least some of the elements of association accessible during a single variation of value of the parameters associated with said element; the output from said fifteenth OR gate being conneoted across said fourteenth AND gate to one input of the ninth AND 33006/2 gate* 1 -43~i Apparatus according to Claim 40, wherein each of the sixth type lines with respect to the sane parameter are connected to the inputs of ninteenth AND gates to form a line of the connecting- elements of the parameter; and wherein the seventh type lines with respect to the sane parameter form the inputs to the tenth AND gates of a line of the connecting elements of said parameter; the output from said tenth AKD gates being connected to the other input of sixteenth OR gates and to the inputs of said sixth AND gates; and wherein the fourteenth type lines are provided, relative to to the same parameter, and forming one of the inputs/a twentieth AND gate* 5 1 -4*· Apparatus according to Claim wherein the tenth OR gate of each connecting element is excited by the signal from the start line at a clock time and the thirteenth AND gate is validated by the ninth line, connected to one of the inputs of said thirteenth AND gate, the output being connected to one cf the inputs of the first OR gate, energizing the first type line. 6 1 45. Apparatus according to Claim -*θ wherein the start line connects the start signal to a twentieth OR gate, the output from said twentieth OR gate being connected to validate a twenty-first AND gate, the output from said twenty-first AND gate forming the connection to the line, or column of said thirteenth lines. 7 1 Apparatus according to Claim wherein each of the elements of association comprises one of said fourth bistable memorization elements, said bistable elements having a control and reset input, the reset int ut being connected to said control line over said eleventh AND gate, the other input of said 33006/2 8 1 · 4?· Apparatus according to Claim 40, wherein each element of association comprises a seventeenth OR gate, the inputs of said seventeenth OR gate being connected to an output of said fifth bistable memorisation element, the output of the fourteenth AND gate and a general control line, said general control line suppressing the constraint of a validation by the ninth AND gate or fromthe output of the fourteenth AND gate or from the output of the fifth bistable memorization element* 9 1 4βι Apparatus according to Claim 4 » wherein each element of association of a oolumn of each association of values matrix comprises a fifteenth line forming an input line, said input line being common to all elements in a oolumn, and being connected to a twenty-second AND gate and a sixteenth input line common to all the elements in a row being connected to a second input of said twenty-second AND gate; the third input to said twenty-second AND gate being formed by the output from the fourth bistable memorization element, the output from said twenty-second AND gate forming one of the inputs to the eleventh OR gate, the other inputs of said eleventh OR gate being formed by the outputs from all the twenty-second AND gates of the respective matrix* 10 1 -49-» Apparatus according to Claim 0» wherefa fifteenth OR gates are provided, the inputs to said fifteenth OR gates being formed by the Outputs of the fifth bistable memorization elements of the elements of association adjacent the respective elements* 11 ! "90"· Apparatus according to claim 40-, wherein the fourth AND gate has as a second input the output of the first bistable memorization element, the output from said fourth AND gate being connected to the second input of the first OR gate* 12 1 53τ· Apparatus according to Claim 40-, wherein a reset line 33006/2 a second input to the first bistable memorisation element. 13 9 ££> Apparatus according to Claim &J wherein each connecting element includes a twenty-third AND gate, a first input of said twenty-third AND gate being connected to the output of the nineteenth AND gate and a seventeenth overall authorisation line is provided, forming a second input to said twenty-third AND gate, the out* put from said twenty-third AND gate forming a second input to the ninth OR gate. 14 2 -53", Apparatus according to Claim *43r, wherein each recording element includes the eighteenth AND gate, the output of said eighteenth AND gate forming the inputs to the fourth OR gate and a seventeenth OR gate. 15 1 5 · Apparatus according to Claim 3, wherein each recording element includes said seventeenth OR gate, an additional input thereof being connected to the recording line of the column of the matrix of recording elements in which the recordingelements is located* 16 1 Js& Apparatus according to Claim 40-, wherein each recording element has the second input o the fourth UR gate connected to the output of the fourth type lines of the recording elements* 17 1 -5Hr# Apparatus according to Claim 40-, wherein each recording element comprises an eighteenth line, to the group of recording elements of one matrix, said common line forming an input to an eighteenth OR gate, the output of which Arms one of three inputs to the first AND gate. 18 1 -57 Apparatus according to Claim 40* comprising elements of association of variation of values, said elements comprising, each an eighteenth OR gate, having one input formed by the output of the sixth bistable memorization element and a seoond input ormed 33006/2 aeventeenth AND gate* 9 1 -56~. Apparatus according to Claim wherein in each element of the variation of association of values a nineteenth reset line is provided, common to the apparatus, said nineteenth reset line forming a second input to a sixth bistable memorization element* 20 1 5 · Apparatus according to Claim wherein each recording line has a twelfth AND gate inserted therein which is energized by the eigh th type line, the recording lines of one recording matrix being all connected to a multiple input gate, said multiple input gate energizing either a twentieth line or, if more than one line is to be energized, the recording lines of each recording matrix, or a twenty-first line if no singleone of the recording lines is energized, the twentieth output lines from all the gates providing to the coordination center the information from the twenty-first line over a nineteenth OR gate, the other inputs of which being connected to the ZERO outputs of all the multiple g es the output from said multiple gates further delivering to the coordination center date of information*ever a twenty-first OR gate, the other inputs of which being connected to the inputs of all the other multiple gates, the output from said twentieth OR gate being connected to a twenty-fourth AND gate, the other input of which is connected to a twenty-eighth AND gate over an inverter. 21 1 ~6r» Apparatus according to claim 4&? wherein an interparameter hierarchy circuit between the recording matrices is provided, comprising: a seventh bistable memorization element for each recording matri connected to a twentieth line of corresponding multiple gates; 35006/2 ι an eightth bistable Memorisation element to indicate that in inter-processing priority has been authorised in the relative, respective recording matrix; and a classification circuit for the recording matrices* connected to the outputs of the seventhmemorization elements and to the inputs of the eighth memorization elements to authorize energization of the specific eighth bistable memorization element which corresponds to the first matrix, taken in the order of hierarchy between the matrices, and in which the specifio seventh element contains data in its memory* 22 * 21 -61-· Apparatus according to Claim -6T, wherein the matrix classification circuit comprises a loop line, having connected thereto as many twenty-fifth AND gates as matrices are present to arrange in hierarchial order, all said twenty-fifth AND gates being permanently energized, exoept that particular one corresponding to the first matrix in the hierarchial arrangement, each of said twenty-fifth AND gates being additionally connected, over an inverter to the input of a twenty-sixth AND gate, a twenty-first OR gate being connected to the output of the seventh memorization elements and being interposed in the loop line after each of said twenty fifth AND gates. 23 21 -6¾ Apparatus according to Claim -60-, wherein the interdata processing priority circuit comprises a control element connected to a first input line connected to the output of the eighth bistable memorization element and to a a second input line said second input line being connected to the output of said eighth memorization element by means of a twenty-seventh AND gate, energized from the output of said seventh bistable memorization elements a second loop line and as many twenty-seventh AND gates inter* - 1 · 33006/2 connected in said loop line aa possible values of action can be recorded in the matrix, all said twenty-seventh AND gates being energized by said control element, except that corresponding to the first date processing step to be taken in the hierarchyJ and each said thirteenth interrogation lines including a twenty- firat AND gate, the input of which being connected to the output of the corresponding twenty-seventh AND gate over an inverter, the fourteenth authorisation line bein& connected to said loop in advance of the subsequent twenty-seventh AND gate by means of a twenty-second OR gate. 24 23 -63·* Apparatus according to Claim -62-, wherein the twenty-first AND gates have three inputs, the third input being connected across a twenty-third OR gate to the output of twentieth AND gates, the inputs of which being connected to the fourteenth authorization lines* 25 ! -64» Apparatus according to Claim 9j wherein the recording lines of all the recording matrices are connected to the inputs of a twenty eighth AND gate, the output of which is connected to one of the inputs of a nineteenth OE gate* 26 1 -65·» Apparatus according to Claim -40-> wherein the outputs of the first memorization elements of the connecting elements corresponding to a matrix are connected to display elements as&oeiated with the matrices, the outputs of the display elements being connected to the inputs of the sixteenth AND ^ates, the oat- put of which controlling the termination of search by the coordination center* 27 -66T Apparatus for the extraction of information for uee with data processing apparatus which includes matrices having bistable elements, and temporary memories} 33006/2. said apparatus analyzing an external system defined by a plurality of parameters, each capable of taking a finite number of values and to undergo, starting from each said values, a finite number of variations* the data processing machine comprising X· a plurality of basic» functionally non-subdivldable sub-assemblies including (a) as many connection oeaters as there are parameters to be memorised, eaoh connection center comprising as many connection elements as there are possible values for the parameter to be considered* each connection element comprising at least one separate first bistable memorization element; (b) as many bi-diaensional recording centers in matrix form as there are parameters in the system, eaoh recording center comprising recording elements included in the recording center matrices, eaoh recording element comprising at least one separate second bistable memorisation element, each state of said second bistable memorisation element corresponding to one of the possible variations of one of the values of the parameter of the respective matrix, and a AND gate controlled from the output from the second bistable memorisation elements; (c) at least one value-associative matrix comprising as many association elements as the number of possible associations, and having a plurality of third bistable memorization elements eaoh state of which corresponds to a different parameter, and a A D gate controlled from one of said third bistable elements; and XX» a data extraction and Interconnection system comprising (a) a first group of four types of interconnecting lines interconnecting the oonneoting elements with respect to a pre* determined parameter, to the recording elements with reapeot to the 33006/2 (1) an INT OACI line interconnecting a connecting ( . element to an input of said AND gate of a row of recording elements associated with one of said values; (2) AUI OACI lines interconnecting the output from a recording element to the first input of a 1111 AND gate of a 1111 AND gate of a corresponding connecting element, the output of which is connected to a 1113 control gate! (3) IN? KACI lines interconnecting the output of a connecting element representative of and corresponding to a particular value of a parameter, to second inputs of said AND gates of the recording elements so that the variation of a value of the parameter corresponding to the columns in which each recording element is arranged defines the same extremes value for the array of recording elements connected to the INT BACI line and said extreme value is that of said conn cting element! (4) AUT EAOX lines interconnecting the outputs of the recording elements to a first input of a 1112 control gate of a corresponding connecting element! (b) SORT ACT recording lines interconnecting the recording elements eaoh of said SORT ACT reoording linos corresponding, for the same column of a recording matrix, to the same variation controlling the actual value of the parameter; (0) a second group of three types of interconnecting lines, interconnecting the connecting elements each, with respect to a value of a parameter to at least a row of value-associative elements of the value-associative matrix, with respect to the same value of a parameter including; (1) INT CAS lines interconnecting the outputs of said 1113 AND gate of a connecting element to at least one of two inputs of 1006 AND gates of a row of associative elements, the - 147 - 35006/2 center of association formed by a group of said value-associative eleaents being associated with a predetermined value with respect to said parameter, the outputs of said 1006 AND gates being connecte to control one of said third bistable elements} and (2) at least two RST Bl lines for each center of association controlling and associated with a predetermined value, each line bel associated with at least two rovs of value-associative elements of a least one center of association associated with said predetermined value, for each parameter, each row of elements being connected to a input of the 1106 ASH gate of the connecting element corresponding to the value of the parameter defined by said row} (3) at least two RET B2 lines for each center of association of the same predetermined value, each line being associated with at least two rows of value-aesoeiatlve elements of at leaet one center of association of said predetermined value, for each parameter, each row of elements being connected to an input of a 1101 AHD gate of the connecting element corresponding to the value of the paramete defined by said row} (d) as many MEM B2 display lines of the values for the group of parameters corresponding to the final state of the system to be controlled, as ere possible values for each parameter, each said M B2 lines being connected to a connecting element which corresponds to the same value of the same parameter} (e) as many HBM BO control lines of the values for the group of parameters corresponding to the initial state of the system to be controlled as are poss ble values for each parameter, each said MEM BO lines being connected to a connecting element which corresponds to the same value of the same parameter} (f) the coordination center exeouting, step by step* the different phases of analysis and comprising: 33006/2 ^ (2) start lines connected to all the connecting elementsf (3) control lines connected to the value association elemental and (4) AUT SORT ACT control lines connected to oontrol energisation by said SORT ACT recording lines of the same column of recording elements in a recording matri t (5) I¾F BO lines, and a comparator connected to sense a predetermined condition and, upon such sensing* interrupting the extraction stepf and (6) a clock means providing timing signals to said apparatus until said predetermined condition is sensed and the extraction steps interrupted* 149