Natural 2D visualization of 1D bit data: Difference between revisions

From apm
Jump to navigation Jump to search
← Older edit
→Related: added 2021 "Can Tensor Programming Be Liberated from the Fortran Data Paradigm?"
 
Line 21: Line 21:
== Related ==
== Related ==


* [[A more natural data representation for array and tensor datastructures]] {{wikitodo|Make that page and link Conal Elliots paper. And back-link here.}}
* [[A true but useless theory of everything]]
* [[A true but useless theory of everything]]
* [[The program of all programs (code)]]
* [[The program of all programs (code)]]

Latest revision as of 11:11, 5 September 2024

Natural 2D visualization of 1D bit data.

Question: How can a one dimensional stream of data be displayed as 2D visual graphic in the most natural way
when there is no information at all provided about correct interpretation?

Specifically:
How could the progression of evaluation of an untyped lambda expression be
most naturally mapped to a black and white pixels 2D visualization?

The right approach cannot involve any 2D array type interpretation since this introduces
an arbitrary line-end wraparound length. Rather one wants to use an in-an-obvious-natural-way serializable representation of 2D bit data that
does not contain an arbitrary line-end wraparound length.
Tries/MemoTries might do the trick.

In a sequence of evaluations of a lambda calculus expressions much of the structure often stays static and unchanged.
So one might want to visualize the differences instead.

Related

Related

Conal Elliott (draft 2018) – "Data-Parallel Programming without Arrays"

Trie datastructure

Retrieved from "https://apm.bplaced.net/w/index.php?title=Natural_2D_visualization_of_1D_bit_data&oldid=16770"