Data

12/23/2017
by   Johannes Reich, et al.
0

In this article, the data notion is mathematically conceptualized as typed information based on the two concepts of information and computable functionality. A data type is defined as a pair of a set of distinguishable characters (an alphabet) and a set of operations (surjective, computable functions) that operate on this alphabet as domain and capture the intent of a parameterizable concept. Two different ways to construct new data types from existing ones are described: restriction and extension. They lead to two different partial orders on types in the sense of subtyping as formulated by Liskov and Wing. It is argued that the proposed data concept matches the concept of characteristics (Merkmale) of the automation industry.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/20/2019

Next Priority Concept: A new and generic algorithm computing concepts from complex and heterogeneous data

In this article, we present a new data type agnostic algorithm calculati...
research
05/11/2023

How Much Partiality Is Needed for a Theory of Computability?

Partiality is a natural phenomenon in computability that we cannot get a...
research
10/31/2020

Partial Functions and Recursion in Univalent Type Theory

We investigate partial functions and computability theory from within a ...
research
01/28/2021

Fixpoints and relative precompleteness

We study relative precompleteness in the context of the theory of number...
research
04/13/1999

A Computer Scientist's View of Life, the Universe, and Everything

Is the universe computable? If so, it may be much cheaper in terms of in...
research
03/09/2023

Transport via Partial Galois Connections and Equivalences

Multiple types can represent the same concept. For example, lists and tr...

Please sign up or login with your details

Forgot password? Click here to reset