Difference between revisions of "Data decompression chain"

From apm
Jump to: navigation, search
(basic page)
(No difference)

Revision as of 07:05, 2 October 2015

This article is a stub. It needs to be expanded.
This article defines a novel term (that is hopefully sensibly chosen). The term is introduced to make a concept more concrete and understand its interrelationship with other topics related to atomically precise manufacturing. For details go to the page: Neologism.

The data decompression chain is the sequence of expansion steps from

  • very compact highest level abstract blueprints of technical systems to
  • discrete and simple lowest level instances that are much larger in size.

3D modelling

(TODO: add details)

  • high language 1: functional, logical, connection to computer algebra system
  • high language 2: imperative, functional
  • constructiv esolid geometry graph (CSG graph), parametric surfaces
  • quadrik nets C1
  • triangle nets C0
  • toolpaths
  • Primitive signals: step-signals, rail-switch-states, clutch-states, ...

Targets

  • physical object
  • virtual simulation

Similar situations in today's computer architectures

  • high level language -> compiler infrastructure (e.g. llvm) -> assembler language -> actual actions of the target data processing machine

Related

  • Control hierarchy
  • mergement of GUI-IDE & code-IDE
  • The reverse: while decompressing is a technique compressing is an art - (a vague analog to derivation and integration)
    See: the source of new axioms Warning! you are moving into more speculative areas.
Retrieved from "http://apm.bplaced.net/w/index.php?title=Data_decompression_chain&oldid=4362"