Any material realization of the (M,R)-systems must have noncomputable models.
Robert Rosen's (M,R)-systems are a class of relational models with a structure that defines a necessary distinguishing feature of organisms. That feature is an impredicative hierarchy of constraint on the properties of the model that correspond to the closure of an organism's entailment relations with respect to efficient cause. As a consequence, a computable model cannot be an (M,R)-system. This has been mathematically proven, and hence indisputable. Nevertheless, "computable" implementations of the mappings in an (M,R)-system have been reported. This paper explains the logical impossibility of the existence of these "counterexamples." In particular, it examines the errors in the construction of one of the most interesting among them. The relevance of this result to neuroscientists is that the same structure of closure to efficient cause is observed in brain dynamics.
Louie
A H
AH
ahlouie@rogers.com
D000465:Algorithms; D001921:Brain / Q000502:physiology*; D008959:Models, Neurological