The Synchronic Computation project bootstraps the development of novel languages and machine models to address programmability and performance issues in parallelism and concurrency, and other foundational issues, in a series of conceptual stages.
- In response to perceived defects in conventional tree syntax, a non-graph based, textual language system incorporates a synchronised, abstract machine environment called interlanguage, for concurrent expression and concise description of many-to-many relationships and DAGs.
- Interlanguage provides insights for deriving formal, bit-level, synchronous machine models called the α-Ram family. Such low level conceptual machines are unique in providing a simple, executable semantics for exploring fundamental parallel language and machine concepts, without introducing bias and complexity from higher level machines. α-Rams are also put forward as ground models for a constructive, compiler oriented semantics for the formal definition of any programming language, and for any model of parallelism/concurrency.
- Interlanguages and α-Rams allow the development of a general purpose environment called Space, for expressing parallelism and concurrency. Space is textual but bypasses the parallel unfriendly features of natural language based conventional tree syntax, found in mainstream programming languages.
- Space and α-Rams are used to develop reconfigurable, specialised and more general purpose Field Programmable Object Arrays, supporting control intensive operations, called Synchronic Engines. A Synchronic Engine network is put forward as a novel archetype for high performance computing.
- Using only enough informal logic and set theory to define α-Rams, recast foundational mathematical structures, including logic and the axioms of set theory, as parallelised, dynamic computational structures. Both constructive and non-constructive approaches could be pursued.
- Further practical and theoretical objectives.
Updated 24 Nov 2020.