Proper em-dashes are proper.
catseye
9 years ago

22 | 22 | are the *neighbours* (in the USA: *neighbors*) of X. |

23 | 23 | |

24 | 24 | We may say that a hedgehog is "one of the hedgehogs to the left" (resp. |

25 | "right") of some other hedgehog; the meaning of this should be evident -- it | |

25 | "right") of some other hedgehog; the meaning of this should be evident — it | |

26 | 26 | is just the transitive closure of "to its left" (resp. right). |

27 | 27 | |

28 | 28 | All hedgehogs share a fixed speed at which they move (when they move), and a |

175 | 175 | introduced in follower hedgehog movements, lest they get stuck. |

176 | 176 | |

177 | 177 | We may want to go further, and allow the space itself to expand whenever a |

178 | hedgehog is added to the troupe -- so long as all the relative directions | |

178 | hedgehog is added to the troupe — so long as all the relative directions | |

179 | 179 | between things are preserved, this should not affect the outcome. |

180 | 180 | |

181 | 181 | (The idea for this system came to me sort of all at once when I was thinking |

205 | 205 | with appropriate modifications. |

206 | 206 | |

207 | 207 | We have also not constrained the sets of faery rings and hills to be finite; |

208 | so we could have an infinite number of them in an infinite space -- but for | |

208 | so we could have an infinite number of them in an infinite space — but for | |

209 | 209 | correspondence with a Turing machine, these should probably be restricted to |

210 | 210 | infinite sets. (Otherwise, if you have, say, an uncountable set of faery |

211 | 211 | rings, specified non-constructively, you could encode all possible |