Original question and givens
Use deterministic single-tape states=[q010, q110, qa10, qr10], input_alphabet=[010], tape_alphabet=[010, X10, _10], blank=_10, start=q010, accept=qa10, reject=qr10, transitions=[[q010, 010, q110, X10, R], [q010, _10, qr10, _10, S], [q110, _10, qa10, _10, L]]. Each transition is [state,read,next,write,L/R/S]; keys [state,read] are unique and halting states have no outgoing transitions. Input symbols form a blank-free tape subset. The integer-indexed tape is blank at every unlisted cell, with configuration [state,head,sparse nonblank tape]; L may move left of0. Canonical answer transitions/tape cells retain the source sort convention. Input=[010], step budget=2. Give (input, step_budget, configurations, step_outcomes, final_state, local_outcome, global_decider_certificate, boundary).
G001 — Use deterministic single-tape states=[q010, q110, qa10, qr10], input_alphabet=[010], tape_alphabet=[010, X10, _10], blank=_10, start=q010, accept=qa10, reject=qr10, transitions=[[q010, 010, q110, X10, R], [q010, _10, qr10, _10, S], [q110, _10, qa10, _10, L]]. Each transition is [state,read,next,write,L/R/S]; keys [state,read] are unique and halting states have no outgoing transitions. Input symbols form a blank-free tape subset. The integer-indexed tape is blank at every unlisted cell, with configuration [state,head,sparse nonblank tape]; L may move left of0. Canonical answer transitions/tape cells retain the source sort convention. Input=[010], step budget=2. Give (input, step_budget, configurations, step_outcomes, final_state, local_outcome, global_decider_certificate, boundary).
Step-by-step derivation
S001 · implies
Before
source roles = [tm-exact-step-trace]
After
derived = [[input, step_budget, configurations, step_outcomes, final_state, local_outcome, global_decider_certificate, boundary]]
Conditions: none
List the full source field order without JavaScript,keeping original data,Boolean flags,mathematical objects and nonclaims distinct.
Step identifiers and dependencies
Rule: source_ordered_fields_without_JS · Uses: G001
S002 · implies
Before
source roles = [[q010, q110, qa10, qr10], [010], [010, X10, _10], _10, q010, qa10, qr10, [[q010, 010, q110, X10, R], [q010, _10, qr10, _10, S], [q110, _10, qa10, _10, L]]]
After
derived = [[q010, q110, qa10, qr10], [010], [010, X10, _10], [[q010, _10, qr10, _10, S], [q010, 010, q110, X10, R], [q110, _10, qa10, _10, L]], Yes]
Conditions: none
All three lists are nonempty and unique;input is a blank-free tape subset,but state and alphabet labels may overlap.Source NUL-joined(from,read) keys are unique,and halting states have no outgoing rules.A partial table is legal,not filled with rejection;transition collation and UTF16 set order differ.
Step identifiers and dependencies
Rule: TM_complete_signature_partial_transition_table_allowed · Uses: G001, S001
S003 · implies
Before
source roles = [[010], q010, _10]
After
derived = [[q010, 0, [[0, 010]]]]
Conditions: none
Initially head0,input occupies integer cells from0,and every other cell is blank.The sparse record contains nonblank cells only;negative indices are legal.
Step identifiers and dependencies
Rule: TM_exact_initial_configuration_blank_elsewhere · Uses: G001, S002
S004 · calculation
Before
TM exact integer head move0 := sum(0, 1)
After
TM exact integer head move0 = 1
Conditions: none
Substitute original roles and established intermediates exactly,checking nonzero denominators without floats.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S003
S005 · implies
Before
source roles = [0, [q010, 0, [[0, 010]]], 010, [q010, 010, q110, X10, R]]
After
derived = [step, [q110, 1, [[0, X10]]]]
Conditions: none
Write at the old head first,delete a blank cell,then update state and move exactly L/R/S according to the source rule.
Step identifiers and dependencies
Rule: TM_source_rule_exact_read_write_state_move · Uses: G001, S004
S006 · calculation
Before
TM exact integer head move1 := sum(1, -1)
After
TM exact integer head move1 = 0
Conditions: none
Substitute original roles and established intermediates exactly,checking nonzero denominators without floats.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S005
S007 · implies
Before
source roles = [1, [q110, 1, [[0, X10]]], _10, [q110, _10, qa10, _10, L]]
After
derived = [step, [qa10, 0, [[0, X10]]]]
Conditions: none
Write at the old head first,delete a blank cell,then update state and move exactly L/R/S according to the source rule.
Step identifiers and dependencies
Rule: TM_source_rule_exact_read_write_state_move · Uses: G001, S006
S008 · implies
Before
source roles = [[010], 2, [[q010, 0, [[0, 010]]], [q110, 1, [[0, X10]]], [qa10, 0, [[0, X10]]]], [step, step]]
After
derived = [qa10, accept, No]
Conditions: none
Only actual halting states accept or reject.Exhaustion or stuck is neither ordinary rejection nor a proof of infinite running.One finite input trace supplies no all-input decider certificate.
Step identifiers and dependencies
Rule: TM_finite_trace_input_budget_scope_NOT_global_decider · Uses: G001, S007
Result
([010], 2, [[q010, 0, [[0, 010]]], [q110, 1, [[0, X10]]], [qa10, 0, [[0, X10]]]], [step, step], qa10, accept, No, finite_trace_is_input_local_and_does_not_certify_a_global_decider)
The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.