原題與已知條件
deterministic single-tape signature、exact configuration semantics與decider total-correctness boundary。操作=tm-global-decider-ranking;資料={"states":["scan","accept","reject"],"input_alphabet":["a10","b10"],"tape_alphabet":["a10","b10","_"],"blank":"_","start_state":"scan","accept_state":"accept","reject_state":"reject","transitions":[["scan","a10","scan","a10","R"],["scan","b10","accept","b10","S"],["scan","_","reject","_","S"]],"target_symbol":"b10"}。請依 exact_ordered_tuple_declared_by_interface 欄序回答。
G001 — deterministic single-tape signature、exact configuration semantics與decider total-correctness boundary。操作=tm-global-decider-ranking;資料={"states":["scan","accept","reject"],"input_alphabet":["a10","b10"],"tape_alphabet":["a10","b10","_"],"blank":"_","start_state":"scan","accept_state":"accept","reject_state":"reject","transitions":[["scan","a10","scan","a10","R"],["scan","b10","accept","b10","S"],["scan","_","reject","_","S"]],"target_symbol":"b10"}。請依 exact_ordered_tuple_declared_by_interface 欄序回答。
逐步推導
S001 · implies
操作前
source roles = [tm-global-decider-ranking]
操作後
derived = [[states, input_alphabet, tape_alphabet, blank, start, accept, reject, transitions, target_symbol, ranking, decrease_rule, step_bound, schema_decider_certificate, certificate]]
條件:無
直接列來源完整欄序,不需JavaScript;原題、布林旗標、數學物件與非聲稱保持分層。
步驟識別與依賴
規則:source_ordered_fields_without_JS · 依賴:G001
S002 · implies
操作前
source roles = [[scan, accept, reject], [a10, b10], [a10, b10, _], _, scan, accept, reject, [[scan, a10, scan, a10, R], [scan, b10, accept, b10, S], [scan, _, reject, _, S]]]
操作後
derived = [[accept, reject, scan], [a10, b10], [_, a10, b10], [[scan, _, reject, _, S], [scan, a10, scan, a10, R], [scan, b10, accept, b10, S]], 是]
條件:無
三個清單皆非空且唯一;input是blank-free tape子集,但state與字母標籤不要求不相交。每個(from,read)的來源NUL-joined key唯一、halt無出邊。partial table合法,不補reject規則;canonical transition序與UTF16集合序分開。
步驟識別與依賴
規則:TM_complete_signature_partial_transition_table_allowed · 依賴:G001, S001
S003 · implies
操作前
source roles = [b10, 否, [[accept, reject, scan], [a10, b10], [_, a10, b10], _, scan, accept, reject, [[scan, _, reject, _, S], [scan, a10, scan, a10, R], [scan, b10, accept, b10, S]]]]
操作後
derived = [[[accept, reject, scan], [a10, b10], [_, a10, b10], _, scan, accept, reject, [[scan, _, reject, _, S], [scan, a10, scan, a10, R], [scan, b10, accept, b10, S]]], 是]
條件:無
要整個signature與所有transition符合指定schema,不能由幾個成功trace給任意TM全域證書。
步驟識別與依賴
規則:TM_EXACT_canonical_scan_schema_not_sampled_machine · 依賴:G001, S002
S004 · implies
操作前
source roles = [b10, [a10, b10], [[scan, _, reject, _, S], [scan, a10, scan, a10, R], [scan, b10, accept, b10, S]]]
操作後
derived = [ANY legal w:scan head k<=|w|,first k symbols target-free,tape unchanged, scan rank=|w|-k+1;halting rank=0, nontarget R step lowers rank by1;target accept or blank reject lowers to0, EVERY word halts within |w|+1;accept iff target occurs]
條件:無
歸納任意字的scan prefix;每個非目標字元copy並R,遇target接受,抵blank拒絕。halt後rank定0才涵蓋最後一步的嚴格下降。合法input無blank,故界|w|+1;同一invariant同時證答案正確,不只是終止。
步驟識別與依賴
規則:TM_ANY_word_prefix_invariant_rank0_after_halt_bound · 依賴:G001, S003
結論
([accept, reject, scan], [a10, b10], [_, a10, b10], _, scan, accept, reject, [[scan, _, reject, _, S], [scan, a10, scan, a10, R], [scan, b10, accept, b10, S]], b10, ranking=unscanned_input_cells_plus_one, strictly_decreases_on_every_scan_step, |w|+1, 是, global_termination_and_answer_correctness_certificate_for_all_words)
依上列完整代值及條件核對得到原題答案;原題編號、格式與狀態保持不變。