A computable framework for accountable data assets
Revision as of 05:16, 12 May 2022 by Benkoo (talk | contribs) (→Closure Property offered by Algebra of Systems)
Synoposis
This article prescribes an algebraic approach to manipulate data content in a unifying data abstraction framework. For non-mathematicians, this computational framework can be thought of as an highly automated and mechanized accounting system that can be extended to serve a wide range of resource authentication and authorization applications.
Introduction
According to Rambaud and Pérez[1][2], the goal of our computational framework is to automate the decision procedures for the following activities:
- Decide how to classify the data collected and send the collected data to relevant data processing workflows.
- Whether a given data set is considered admissible or not. This is judged in terms of its data formats and legal value ranges.
- Whether a transaction process is allowable, or not. This include whether a given transaction is feasible, in relevant operational/business logics.
Ownership associated with Accounts
Data Content that represent Decision Procedures
The Control Structure(If/Then/Else)
Computable Data Types
It is been defined axiomatically that all computable data types are Partially-ordered sets.
Lattices and Partially Ordered Sets
The Notion of Closure offered by Algebra
Software Applications
Conclusion
References
- ↑ Rambaud, Salvador Cruz; Pérez, José García; Nehmer, Robert A.; Robinson, Derek J S Robinson (2010). Algebraic Models for Accounting Systems. local page: Cambridge at the University Press. ISBN 978-981-4287-11-1.
- ↑ Rambaud, Salvador Cruz; Pérez, José García (2005). "The Accounting System as an Algebraic Automaton". INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS. local page: Wiley Periodicals, Inc. 20: 827–842.