Related changes
← LIATA
Enter a page name to see changes on pages linked to or from that page. (To see members of a category, enter Category:Name of category). Changes to pages on your Watchlist are in bold.
List of abbreviations:
- N
- This edit created a new page (also see list of new pages)
- m
- This is a minor edit
- b
- This edit was performed by a bot
- (±123)
- The page size changed by this number of bytes
1 October 2025
| 04:59 | Linear-Inequality Affine Transformation Automata diffhist +320 Sligocki talk contribs (→Formal Definition: Move Turing complete stuff to a new section and some general format cleanup.) | ||||
30 September 2025
|
|
N 20:43 | Linear-Inequality Affine Transformation Automata 2 changes history +2,682 [Sligocki (2×)] | |||
| m |
|
20:43 (cur | prev) +53 Sligocki talk contribs (→Formal Definition: Note that g is a linear function.) Tag: Visual edit | |||
| N |
|
20:37 (cur | prev) +2,629 Sligocki talk contribs (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 | |||