Comments
-
jcole 10 months ago-
jcole 10 months ago
too easy -
PkmnQ is cool 10 months agoI thought I checked that one and saw nothing, I guess I should've searched better -
🧀 231DeimaJ 10 months agoHow did you find it -
Maximus 10 months agoit's the first line of the page
-
I can see this being a description of a special type of machine, where -> means one step, and -> * means zero or more steps while ->
+ means one or more steps. This then means that M (presumably a machine) enters a set of states C (defined as there exists a c within set C such that O (the intial state of the machine?) leads to c in zero or more steps), such that all states within C lead to other states within C (for every state in C, there is a d within C where c leads to d within 1 or more steps) and no state c within C halts. Although, it seems like 3 can be proved from the way statement 2 is formalized here? -
I can assume this is a proof of something? I don't know what place would use "enters", "closed", and "non-halting" this close to each other, though. -
i dont really know what it is lol. it's under the 'general definition' subheading if that helps
-
