# Talk:Eodermdrome

Please post some examples. This is an original language as far as i can tell, but I can't understand it at the moment. Examples would be wonderful. Revcompgeek 03:13, 10 December 2008 (UTC)

- I may do some time. The problem is it's also a very hard language to write in, and I haven't got any working non-trivial programs yet. --ais523 10:44, 12 December 2008 (UTC)

I started designing the implementation of SK combinator calculus in Eodermdrome.

But it's not easy. In addition to defining the term encoding and rewrite rules, one needs to define helpers for term destruction (in the case of K) and term duplication (in the case of S). It would be easier to define the BCWI combinator calculus, but that's not even Turing complete IIRC. -- User:atehwa 22 July 2011

## Question about the categories

How it can be "Turing tarpit" and also "Unknown computational class"? The definition of "Turing tarpit" requires that the language will be Turing Complete! --(this comment by 77.125.146.64 at 16:02, 25 May 2009 UTC; please sign your comments with ~~~~)

- (
*Whistles innocently*) Fixed. --Ørjan 16:44, 28 May 2009 (UTC)

## Name

The name "eodermdrome", graphed, is itself a clique with 5 nodes. OberoN (talk) 13:46, 26 July 2012 (UTC)

## multiple matches

What is the expected behaviour if the internal state graph contains more than one subgraph that's isomorphic to the command's match subgraph? My initial assumption was "replace all such subgraphs", but they may overlap. Should one possible match be chosen in an arbitrary manner? --GreyKnight (talk) 10:54, 16 April 2014 (EDT)

- Yeah, the standard solution is just to pick a match nondeterministically. Phantom Hoover (talk) 10:58, 16 April 2014 (EDT)