Difference between revisions of "Representable Functor"

From PKC
Jump to navigation Jump to search
Line 1: Line 1:
{{WikiEntry|key=Representable Functor|qCode=386320}} or Representability is a mathematical idea that all data types can be uniquely referenced onto a set-based representation, meaning that all data entries can be mapped onto a unique entry in a set.
{{WikiEntry|key=Representable Functor|qCode=386320}} often related to the idea of '''representability''', is a mathematical idea that all data types can be uniquely referenced onto a set-based representation, meaning that all data entries can be mapped onto a unique entry in a set.


[[Category:Category Theory]]
[[Category:Category Theory]]
[[Category:Representable Functor]]
[[Category:Representable Functor]]

Revision as of 05:50, 18 February 2022

Representable Functor(Q386320) often related to the idea of representability, is a mathematical idea that all data types can be uniquely referenced onto a set-based representation, meaning that all data entries can be mapped onto a unique entry in a set.