Abstract: A computer having a programmable network assumes specialized operating configurations corresponding to the functions to be executed at each cycle. For such a computer, the program consists of the description of a Finite State Machine (FSM) that performs the desired process. The language for describing these FSMs consists of digital words formed with a grammar similar to that of spoken languages. This language is equally well suited for expressing the processes that the user has in mind and for actually controlling the computer, thus making the compiler unnecessary. The data related to each FSM are organized in the form of pages that circulates between the registers of the programmable network and a memory that configurates itself as the data, thus making the burden of addressing unnecessary.