Gini and undercoverage at the upper tail: a simple approximation

Author(s):  
Pablo Gutiérrez Cubillos
Keyword(s):  
1971 ◽  
Vol 10 (11) ◽  
pp. 2547_1
Author(s):  
R. E. Hufnagel
Keyword(s):  

1977 ◽  
Vol 1 (1) ◽  
pp. 71-91
Author(s):  
Jerzy Tiuryn

An M-groupoid is a simplified model of computer. The classes of M-groupoids, address machines, stored program computers and iterative systems are presented as categories – by a suitable choice of homomorphisms. It is shown that the first three categories are equivalent, whereas the fourth is weaker (it is not equivalent to the previous ones and it can easily be embedded in the category of M-groupoids). This fact proves that M-groupoids form an essentially better and reasonably simple approximation of more complicated models of computers than iterative systems.


Sign in / Sign up

Export Citation Format

Share Document