WolframInstitute/TuringMachine

WolframInstitute`TuringMachine`

NonTerminatingTuringMachineQ

	NonTerminatingTuringMachineQ [rules,input,n] gives True if the machine defined by the integer rules enters a cycle within n steps (assuming 2 states, 2 symbols).
	NonTerminatingTuringMachineQ [rules,s,k,input,n] specifies the number of states s and symbols k.
	NonTerminatingTuringMachineQ [{number,s,k},input,n] checks a specific deterministic rule.

Details and Options

▪

Returns

True

only when a repeated configuration (a cycle) is detected within the step bound; a machine that simply has not halted yet within n steps is not reported as non-terminating.

▪

The deterministic form takes a single

{number,s,k}

rule, while the list form treats the rule numbers as a multiway machine.

Examples

(0)