原題與已知條件
明示decision predicates與complete total map的雙向membership equivalence。操作=mreduction-decider-transfer-boundary;資料={"mode":"reverse_misuse","source_carrier":[0,1,2,3,4,5,6,7,8,9,10,11],"target_carrier":[0,1],"source_yes":[1,3,5,7,9,11],"target_yes":[1],"mapping":[0,1,0,1,0,1,0,1,0,1,0,1],"target_decider":[false,true]}。請依 exact_ordered_tuple_declared_by_interface 欄序回答。
G001 — 明示decision predicates與complete total map的雙向membership equivalence。操作=mreduction-decider-transfer-boundary;資料={"mode":"reverse_misuse","source_carrier":[0,1,2,3,4,5,6,7,8,9,10,11],"target_carrier":[0,1],"source_yes":[1,3,5,7,9,11],"target_yes":[1],"mapping":[0,1,0,1,0,1,0,1,0,1,0,1],"target_decider":[false,true]}。請依 exact_ordered_tuple_declared_by_interface 欄序回答。
逐步推導
S001 · implies
操作前
source roles = [mreduction-decider-transfer-boundary]
操作後
derived = [[mode, membership_rows, total, reduction, target_decider, target_decider_correct, constructed_source_decider_or_null, constructed_source_decider_correct, requested_forward_transfer_certificate, reverse_or_infinite_computability_claim, boundary]]
條件:無
本頁直接列完整來源欄序,不需JavaScript;contract的6/4/6/6與IVT的8/7/8由原mode選,不補欄也不由答案形狀猜。
步驟識別與依賴
規則:source_ordered_fields_without_JS · 依賴:G001
S002 · implies
操作前
source roles = [Reduction ORIGINAL map, [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11], [0, 1], [0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1]]
操作後
derived = [[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11], [0, 1], [0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1], [[0, 0, 是], [1, 1, 是], [2, 0, 是], [3, 1, 是], [4, 0, 是], [5, 1, 是], [6, 0, 是], [7, 1, 是], [8, 0, 是], [9, 1, 是], [10, 0, 是], [11, 1, 是]], 是, null]
條件:無
source數值排序要連image一起移動;target也數值排序。null/outside/Boolean不是合法integer target值,False不能當0;qualification保實際rawimage與首invalid row,不先捏造total map。
步驟識別與依賴
規則:Reduction_original_domain_IMAGE_pairs_sorted_together_STRICT_types · 依賴:G001, S001
S003 · implies
操作前
source roles = [Reduction ORIGINAL map, [1, 3, 5, 7, 9, 11], [1], [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11], [0, 1], [0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1]]
操作後
derived = [[[0, 否, 0, 否, 是], [1, 是, 1, 是, 是], [2, 否, 0, 否, 是], [3, 是, 1, 是, 是], [4, 否, 0, 否, 是], [5, 是, 1, 是, 是], [6, 否, 0, 否, 是], [7, 是, 1, 是, 是], [8, 否, 0, 否, 是], [9, 是, 1, 是, 是], [10, 否, 0, 否, 是], [11, 是, 1, 是, 是]], 是, 是]
條件:無
每個x都驗x∈A iff f(x)∈B,包含yes與no兩方向;invalid image的target predicate是null而非False。totality與membership責任合取才是此有限reduction。
步驟識別與依賴
規則:Reduction_EVERY_yes_AND_no_membership_IFF_not_yes_only · 依賴:G001, S002
S004 · implies
操作前
source roles = [reverse_misuse, [0, 1], [否, 是], [[0, 否, 0, 否, 是], [1, 是, 1, 是, 是], [2, 否, 0, 否, 是], [3, 是, 1, 是, 是], [4, 否, 0, 否, 是], [5, 是, 1, 是, 是], [6, 否, 0, 否, 是], [7, 是, 1, 是, 是], [8, 否, 0, 否, 是], [9, 是, 1, 是, 是], [10, 否, 0, 否, 是], [11, 是, 1, 是, 是]]]
操作後
derived = [[0, 1], [否, 是], 是, [否, 是, 否, 是, 否, 是, 否, 是, 否, 是, 否, 是], 是, 否, 否]
條件:無
decider先連原始target carrier再重排,必為真正Boolean表。只有total map才構造A表,partial給null。reverse_misuse的A表可正確但仍拒反向用途;yes-only可含partial/vacuous yes,不能私加total前提。有限表只證這些finite domains,不證無限computability。
步驟識別與依賴
規則:Reduction_original_TARGET_decider_alignment_FORWARD_transfer_mode_boundary · 依賴:G001, S003
結論
(reverse_misuse, [[0, 否, 0, 否, 是], [1, 是, 1, 是, 是], [2, 否, 0, 否, 是], [3, 是, 1, 是, 是], [4, 否, 0, 否, 是], [5, 是, 1, 是, 是], [6, 否, 0, 否, 是], [7, 是, 1, 是, 是], [8, 否, 0, 否, 是], [9, 是, 1, 是, 是], [10, 否, 0, 否, 是], [11, 是, 1, 是, 是]], 是, 是, [否, 是], 是, [否, 是, 否, 是, 否, 是, 否, 是, 否, 是, 否, 是], 是, 否, 否, A_le_m_B_plus_B_decidable_transfers_decidability_to_A_not_the_reverse_partial_maps_and_yes_only_checks_are_invalid_and_finite_tables_do_not_prove_infinite_computability)
依上列完整代值及條件核對得到原題答案;原題編號、格式與狀態保持不變。