Computable Organizations-Representation by Sequential Machine Theory

In this paper we investigate certain types of organizational forms which are considered to be sequentially computable rather than Turing computable, i.e. we are considering those organizations which are subject to definite resource and time constraints and which can be split into elementary computational operations.