In mathematics, the Skolem problem is the problem of determining whether the values of a constant-recursive sequence include the number zero. The problem can be formulated for recurrences over different types of numbers, including integers, rational numbers, and algebraic numbers. It is not known whether there exists an algorithm that can solve this problem.A linear recurrence relation expresses the values of a sequence of numbers as a linear combination of earlier values; for instance, the Fibonacci numbers may be defined from the recurrence relation
F(n) = F(n − 1) + F(n − 2)together with the...
Light-Cycle KotH
koth
Basically the light-cycle game as a KotH competition.
The Game
Players will write bots that compete in a light-cycle arena. A round of light-cycle starts with bots randomly spaced out along the edge of a (tentatively 10x20) rectangular play area:
+--------------------+
| ...
Grok, 91 bytes
``iI96PYWwIiWjw hlI10WI PYWYWYWYWYWYWYWYWYWYWYWYWYWIlWIYWIPWI!WI{WIkWq
lYP!{k
Try it Online!
It is very costly to output anything in Grok. Shortening the second line would be a way to shorten this but I can't figure it out.
GotoOutput, 33 bytes
Goto Hello,\_World!
Hello,\_World!
A less trivial solution which demonstrates the language's intended control flow would be:
Assign g o
Goto H
H Goto e
e Goto l
l If l
GotoFrom g
\_ l
Goto l
o If o
Goto r
\_ o
Goto ,
, Goto \_
\_ Goto W
W Assign g d
Goto o
r Goto l...
