
 ARTIFICIAL SEMANTICALLY CLOSED OBJECTS 
  However, proving the computability of a function, by means of a Turing machine or equivalent, is a strenuous exercise, and if all functions had to be strictly checked as to their computability in all mathematical activities, it would be impossible to have mathematics moving forward. 
  Another important point is that for a given state and a given symbol read by the Turing Machine, at most one instruction is applicable, in other words, at any step of its operative process the succeeding step is univocally defined; this means that computational processes are statedetermined and therefore dynamically incoherent. 
  Memory does not exist in the computational level of weights and adding machines, it is everywhere, unretrievable, in the present state of the measurement device working at the functional level we are interested in. 
 www.informatics.indiana.edu /rocha/tilsccai.html (8032 words) 
