All public logs

Combined display of all available logs of BusyBeaverWiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 20:37, 30 September 2025 Sligocki talk contribs created page Linear-Inequality Affine Transformation Automata (Created page with "'''Linear-Inequality Affine Transformation Automata (LIATA)''' are a model for computation based upon applying affine transformations to vectors based on cases defined by linear inequalities. They are a generalization of the rules for BMO1 and were proven to be Turing complete. == Example == An example of a LIATA are the rules for BMO1:<math display="block">f(a,b) = \begin{cases} (a-b, 4b+2) & \text{if } a > b \\ (2a+1, b-a) & \text{if } a < b \\ \end{cases}</ma...") Tag: Visual edit