We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.
Ant again
Jump to navigation
Jump to search
Ant again is a simple Turing-complete esolang made by User:Assembly.
Commands
Ant again is quite simple:
| Instruction | Description |
|---|---|
> |
Move the tape head right to the next cell. |
< |
Move the tape head left to the previous cell. |
? |
If the value of the current cell is 0, skip the next instruction. Else, continue. |
! |
Flip the cell under the tape (if it was 0, it becomes 1. if it was 1, it becomes 0) |
Turing completeness proof
Translation from TEM:
| TEM | AA |
|---|---|
> |
>>
|
< |
<<
|
/ |
?><?>>
|
\ |
?<>?<<
|
1 |
?!!
|
0 |
?!
|
1 cell = 1 AA cell version:
| TEM | AA |
|---|---|
> |
>
|
< |
<
|
/ |
?>
|
\ |
?<
|
1 |
?!!
|
0 |
?!
|
Translation from AEM:
| AEM | AA |
|---|---|
> |
>
|
< |
<
|
/ |
?>
|
\ |
?<
|
% |
!
|
Ant again to BF
x: command
| Instruction | Mapping |
|---|---|
> |
>
|
< |
<
|
? |
[x]
|
! |
[--]+
|
This means that BF can be proved Turing complete using Ant again.