Archive for October, 2006
Interactive computation
Goldin, Smolka et al. (Eds.) 2006 – Interactive computation. Quote from the blurb:
The book challenges traditional Turing machine-based answers to fundamental questions relating to problem solving and the scope of computation.
Okay?! As there are relevant entries in the Web Links section of Pile Systems’ web site to the works of Dina Goldin
Dina Goldin (together with [...]
Filed under: Interactive computation, Pile | Leave a Comment
Pairing function
Pile is a system that uses coordinates (values) to establish position, one unique frame of reference for sequences of computation. A fusion and split function are vital to construe the Pile space. This Haskell script implements the Cantor pairing function and its inverse.
Filed under: Haskell, Haymow, Pile | Leave a Comment
“Lady X”, ToPs, and Monads
“Beginning from the entity ‘Lady X’, just collect all its relations. That’s it.”
The other day, I read Miriam’s pile stories and her example of ‘Lady X’ as a ToP in the Pile plane. Miriam evoked the nightmare of total inclusion. But, how could ‘Lady X’ be digitized into the digital world inside [...]
Filed under: Pile | Leave a Comment
The RSS feed of this blog- An Other Space
- Jessicatz Fairymeadow’s Pile Implementation
- An open public letter to the “Pile Systems” team (Revisited)
- TVs, Tops, and the primary (primordial) self-reference
- Junctions, Perl 6, Haskell, …
- The Prolog Theorem Prover “mflogic.exe”
- Entailments_Context.mov @ 00:03:30
- Pask’s Entailment Meshes
- Multiple Form Logic revisited (after one year)
- Ralf Westphal’s “Intuitive Data Model”
-
Recent Comments
