eyeling 1.24.6 → 1.24.8

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (175) hide show
  1. package/HANDBOOK.md +35 -35
  2. package/dist/browser/eyeling.browser.js +14 -1
  3. package/examples/act-alarm-bit-interoperability.n3 +2 -0
  4. package/examples/act-barley-seed-lineage.n3 +2 -0
  5. package/examples/act-docking-abort.n3 +2 -0
  6. package/examples/act-gravity-mediator-witness.n3 +2 -0
  7. package/examples/act-isolation-breach.n3 +2 -0
  8. package/examples/act-photosynthetic-exciton-transfer.n3 +2 -0
  9. package/examples/act-sensor-memory-reset.n3 +2 -0
  10. package/examples/act-tunnel-junction-wake-switch.n3 +2 -0
  11. package/examples/act-yeast-self-reproduction.n3 +2 -0
  12. package/examples/annotation.n3 +5 -0
  13. package/examples/auroracare.n3 +8 -8
  14. package/examples/backward-recursion.n3 +5 -0
  15. package/examples/barley-seed-becoming.n3 +2 -0
  16. package/examples/bmi.n3 +2 -0
  17. package/examples/builtin-coverage.n3 +5 -0
  18. package/examples/calidor.n3 +3 -3
  19. package/examples/collection.n3 +5 -0
  20. package/examples/complex-matrix-stability.n3 +2 -0
  21. package/examples/context-association.n3 +0 -8
  22. package/examples/control-system.n3 +2 -0
  23. package/examples/deep-taxonomy-10.n3 +2 -0
  24. package/examples/deep-taxonomy-100.n3 +2 -0
  25. package/examples/deep-taxonomy-1000.n3 +2 -0
  26. package/examples/deep-taxonomy-10000.n3 +2 -0
  27. package/examples/deep-taxonomy-100000.n3 +2 -0
  28. package/examples/delfour.n3 +3 -3
  29. package/examples/digital-product-passport.n3 +2 -0
  30. package/examples/dijkstra-risk-path.n3 +1 -2
  31. package/examples/easter.n3 +3 -1
  32. package/examples/eco-route-insight.n3 +1 -2
  33. package/examples/flandor.n3 +3 -3
  34. package/examples/french-cities.n3 +2 -0
  35. package/examples/fundamental-theorem-arithmetic.n3 +2 -0
  36. package/examples/genetic-algorithm-knapsack.n3 +1 -1
  37. package/examples/genetic-algorithm.n3 +1 -1
  38. package/examples/genetic-knapsack-selection.n3 +1 -2
  39. package/examples/gps.n3 +2 -0
  40. package/examples/harborsmr.n3 +2 -0
  41. package/examples/input/rdf-message-flow.trig +10 -10
  42. package/examples/input/rdf-messages.trig +6 -6
  43. package/examples/interop-demo.n3 +3 -1
  44. package/examples/matrix-mechanics.n3 +3 -3
  45. package/examples/medior.n3 +3 -3
  46. package/examples/n3-speaks-for-itself.n3 +5 -0
  47. package/examples/odrl-dpv-ehds-risk-ranked.n3 +1 -1
  48. package/examples/odrl-dpv-healthcare-risk-ranked.n3 +1 -1
  49. package/examples/odrl-dpv-risk-ranked.n3 +1 -1
  50. package/examples/odrl-risk-mitigation.n3 +1 -1
  51. package/examples/odrl-risk.n3 +1 -1
  52. package/examples/output/{act-alarm-bit-interoperability.txt → act-alarm-bit-interoperability.md} +19 -17
  53. package/examples/output/act-barley-seed-lineage.md +27 -0
  54. package/examples/output/{act-docking-abort.txt → act-docking-abort.md} +21 -19
  55. package/examples/output/{act-gravity-mediator-witness.txt → act-gravity-mediator-witness.md} +23 -21
  56. package/examples/output/{act-isolation-breach.txt → act-isolation-breach.md} +26 -24
  57. package/examples/output/{act-photosynthetic-exciton-transfer.txt → act-photosynthetic-exciton-transfer.md} +19 -17
  58. package/examples/output/{act-sensor-memory-reset.txt → act-sensor-memory-reset.md} +19 -17
  59. package/examples/output/{act-tunnel-junction-wake-switch.txt → act-tunnel-junction-wake-switch.md} +20 -18
  60. package/examples/output/{act-yeast-self-reproduction.txt → act-yeast-self-reproduction.md} +22 -20
  61. package/examples/output/annotation.md +1 -0
  62. package/examples/output/auroracare.md +150 -0
  63. package/examples/output/backward-recursion.md +6 -0
  64. package/examples/output/barley-seed-becoming.md +27 -0
  65. package/examples/output/{bmi.txt → bmi.md} +19 -17
  66. package/examples/output/builtin-coverage.md +1 -0
  67. package/examples/output/calidor.md +31 -0
  68. package/examples/output/collection.md +1 -0
  69. package/examples/output/{complex-matrix-stability.txt → complex-matrix-stability.md} +13 -11
  70. package/examples/output/context-association.md +7 -0
  71. package/examples/output/{control-system.txt → control-system.md} +19 -17
  72. package/examples/output/{deep-taxonomy-10.txt → deep-taxonomy-10.md} +14 -12
  73. package/examples/output/{deep-taxonomy-100.txt → deep-taxonomy-100.md} +14 -12
  74. package/examples/output/{deep-taxonomy-1000.txt → deep-taxonomy-1000.md} +14 -12
  75. package/examples/output/{deep-taxonomy-10000.txt → deep-taxonomy-10000.md} +14 -12
  76. package/examples/output/{deep-taxonomy-100000.txt → deep-taxonomy-100000.md} +14 -12
  77. package/examples/output/delfour.md +32 -0
  78. package/examples/output/digital-product-passport.md +3 -0
  79. package/examples/output/dijkstra-risk-path.md +11 -0
  80. package/examples/output/{easter.txt → easter.md} +152 -150
  81. package/examples/output/eco-route-insight.md +20 -0
  82. package/examples/output/flandor.md +33 -0
  83. package/examples/output/{french-cities.txt → french-cities.md} +13 -11
  84. package/examples/output/{fundamental-theorem-arithmetic.txt → fundamental-theorem-arithmetic.md} +14 -12
  85. package/examples/output/genetic-algorithm-knapsack.md +3 -0
  86. package/examples/output/genetic-algorithm.md +3 -0
  87. package/examples/output/genetic-knapsack-selection.md +13 -0
  88. package/examples/output/{gps.txt → gps.md} +14 -12
  89. package/examples/output/harborsmr.md +22 -0
  90. package/examples/output/{interop-demo.txt → interop-demo.md} +3 -1
  91. package/examples/output/matrix-mechanics.md +16 -0
  92. package/examples/output/medior.md +34 -0
  93. package/examples/output/n3-speaks-for-itself.md +54 -0
  94. package/examples/output/{odrl-dpv-ehds-risk-ranked.txt → odrl-dpv-ehds-risk-ranked.md} +16 -15
  95. package/examples/output/{odrl-dpv-healthcare-risk-ranked.txt → odrl-dpv-healthcare-risk-ranked.md} +13 -12
  96. package/examples/output/{odrl-dpv-risk-ranked.txt → odrl-dpv-risk-ranked.md} +17 -16
  97. package/examples/output/{odrl-risk-mitigation.txt → odrl-risk-mitigation.md} +17 -16
  98. package/examples/output/{odrl-risk.txt → odrl-risk.md} +6 -5
  99. package/examples/output/parcellocker.md +22 -0
  100. package/examples/output/pn-junction-tunneling.md +25 -0
  101. package/examples/output/queens.md +23 -0
  102. package/examples/output/{rc-discharge-envelope.txt → rc-discharge-envelope.md} +10 -8
  103. package/examples/output/rdf-dataset.md +7 -0
  104. package/examples/output/rdf-message-flow.md +7 -0
  105. package/examples/output/rdf-messages.md +7 -0
  106. package/examples/output/{resto.txt → resto.md} +19 -17
  107. package/examples/output/school-placement-audit.md +11 -0
  108. package/examples/output/smoke-arithmetic.md +7 -0
  109. package/examples/output/sqrt2-cauchy.md +15 -0
  110. package/examples/output/sqrt2-dedekind.md +33 -0
  111. package/examples/output/{sudoku.txt → sudoku.md} +45 -43
  112. package/examples/output/transcendental-numbers-stretched.md +262 -0
  113. package/examples/output/transistor-switch.md +26 -0
  114. package/examples/output/triple-terms.md +7 -0
  115. package/examples/output/{tunnel-junction-wake-switch-becoming.txt → tunnel-junction-wake-switch-becoming.md} +20 -18
  116. package/examples/output/{wind-turbine.txt → wind-turbine.md} +17 -15
  117. package/examples/parcellocker.n3 +2 -0
  118. package/examples/pn-junction-tunneling.n3 +3 -3
  119. package/examples/queens.n3 +1 -0
  120. package/examples/rc-discharge-envelope.n3 +1 -1
  121. package/examples/rdf-dataset.n3 +5 -0
  122. package/examples/rdf-message-flow.n3 +1 -2
  123. package/examples/rdf-messages.n3 +1 -2
  124. package/examples/resto.n3 +2 -0
  125. package/examples/school-placement-audit.n3 +1 -2
  126. package/examples/smoke-arithmetic.n3 +1 -1
  127. package/examples/sqrt2-cauchy.n3 +2 -0
  128. package/examples/sqrt2-dedekind.n3 +2 -0
  129. package/examples/sudoku.n3 +14 -14
  130. package/examples/transcendental-numbers-stretched.n3 +5 -0
  131. package/examples/transistor-switch.n3 +3 -3
  132. package/examples/triple-terms.n3 +5 -0
  133. package/examples/tunnel-junction-wake-switch-becoming.n3 +2 -0
  134. package/examples/wind-turbine.n3 +2 -0
  135. package/eyeling.js +14 -1
  136. package/lib/explain.js +14 -1
  137. package/package.json +1 -1
  138. package/test/examples.test.js +44 -13
  139. package/test/package.test.js +43 -7
  140. package/examples/output/act-barley-seed-lineage.txt +0 -25
  141. package/examples/output/annotation.n3 +0 -0
  142. package/examples/output/auroracare.txt +0 -149
  143. package/examples/output/backward-recursion.n3 +0 -4
  144. package/examples/output/barley-seed-becoming.txt +0 -25
  145. package/examples/output/builtin-coverage.n3 +0 -0
  146. package/examples/output/calidor.txt +0 -29
  147. package/examples/output/collection.n3 +0 -0
  148. package/examples/output/context-association.n3 +0 -9
  149. package/examples/output/delfour.txt +0 -30
  150. package/examples/output/digital-product-passport.txt +0 -1
  151. package/examples/output/dijkstra-risk-path.n3 +0 -3
  152. package/examples/output/eco-route-insight.n3 +0 -3
  153. package/examples/output/flandor.txt +0 -31
  154. package/examples/output/genetic-algorithm-knapsack.txt +0 -1
  155. package/examples/output/genetic-algorithm.txt +0 -1
  156. package/examples/output/genetic-knapsack-selection.n3 +0 -3
  157. package/examples/output/harborsmr.txt +0 -20
  158. package/examples/output/matrix-mechanics.txt +0 -14
  159. package/examples/output/medior.txt +0 -32
  160. package/examples/output/n3-speaks-for-itself.txt +0 -52
  161. package/examples/output/parcellocker.txt +0 -20
  162. package/examples/output/pn-junction-tunneling.txt +0 -23
  163. package/examples/output/queens.txt +0 -21
  164. package/examples/output/rc-discharge-envelope.n3 +0 -9
  165. package/examples/output/rdf-dataset.n3 +0 -5
  166. package/examples/output/rdf-message-flow.n3 +0 -7
  167. package/examples/output/rdf-messages.n3 +0 -7
  168. package/examples/output/school-placement-audit.n3 +0 -3
  169. package/examples/output/smoke-arithmetic.n3 +0 -5
  170. package/examples/output/smoke-arithmetic.txt +0 -5
  171. package/examples/output/sqrt2-cauchy.txt +0 -13
  172. package/examples/output/sqrt2-dedekind.txt +0 -31
  173. package/examples/output/transcendental-numbers-stretched.txt +0 -260
  174. package/examples/output/transistor-switch.txt +0 -24
  175. package/examples/output/triple-terms.n3 +0 -5
@@ -217,4 +217,4 @@
217
217
  string:format ?Line
218
218
  }
219
219
  log:query
220
- { 1 log:outputString ?Line }.
220
+ { 0 log:outputString "# genetic-algorithm\n\n". 1 log:outputString ?Line }.
@@ -23,10 +23,9 @@
23
23
  :Run :capacity ?Capacity; :localSearchStopsAt :FinalLocal.
24
24
  :FinalLocal :genome ?Genome; :selectedItems ?Items; :weight ?Weight; :value ?Value; :fitness ?Fitness; :generationsEvaluated ?Generations.
25
25
  :ExhaustiveOptimum :genome ?OptGenome; :value ?OptValue.
26
- ("=== Answer ===\nfinal genome : %s\nselected items : %s\nweight : %d / %d\nvalue : %d\nfitness : %d\ngenerations evaluated : %d\nexhaustive optimum value : %d at genome %s\n\n=== Explanation ===\nEach genome bit says whether the corresponding item is selected for the knapsack. Feasible candidates get fitness 1000000 minus value, so higher value means lower fitness; overweight candidates are penalized above every feasible candidate. The N3 source records the deterministic local-search result and validates that the final genome respects capacity and has no strictly better one-bit neighbor. For transparency, an exhaustive enumeration also records the global best feasible value, showing this is a local mutation search rather than a global-optimality claim." ?Genome ?Items ?Weight ?Capacity ?Value ?Fitness ?Generations ?OptValue ?OptGenome) string:format ?Block.
26
+ ("# genetic-knapsack-selection\n\n## Answer\nfinal genome : %s\nselected items : %s\nweight : %d / %d\nvalue : %d\nfitness : %d\ngenerations evaluated : %d\nexhaustive optimum value : %d at genome %s\n\n## Explanation\nEach genome bit says whether the corresponding item is selected for the knapsack. Feasible candidates get fitness 1000000 minus value, so higher value means lower fitness; overweight candidates are penalized above every feasible candidate. The N3 source records the deterministic local-search result and validates that the final genome respects capacity and has no strictly better one-bit neighbor. For transparency, an exhaustive enumeration also records the global best feasible value, showing this is a local mutation search rather than a global-optimality claim." ?Genome ?Items ?Weight ?Capacity ?Value ?Fitness ?Generations ?OptValue ?OptGenome) string:format ?Block.
27
27
  } => {
28
28
  :geneticKnapsackSelection log:outputString ?Block.
29
29
  :geneticKnapsackSelection :selects :FinalLocal.
30
30
  }.
31
31
 
32
- { :geneticKnapsackSelection :selects ?Candidate } log:query { :geneticKnapsackSelection :selects ?Candidate }.
package/examples/gps.n3 CHANGED
@@ -15,6 +15,8 @@
15
15
  @prefix gps: <https://example.org/gps#>.
16
16
  @prefix : <https://example.org/gps-case#>.
17
17
 
18
+ :000_md_title log:outputString "# gps\n\n" .
19
+
18
20
  # -----
19
21
  # Facts
20
22
  # -----
@@ -22,6 +22,8 @@
22
22
  @prefix string: <http://www.w3.org/2000/10/swap/string#> .
23
23
  @prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
24
24
 
25
+ :000_md_title log:outputString "# harborsmr\n\n" .
26
+
25
27
  # -----
26
28
  # Facts
27
29
  # -----
@@ -13,7 +13,7 @@
13
13
  # Formal Eyeling input evidence in RDF 1.2 TriG.
14
14
  # The generated runner reads this TriG evidence directly.
15
15
 
16
- :temperatureFlow rdf:type msg:MessageStream .
16
+ :temperatureFlow a msg:MessageStream .
17
17
  :temperatureFlow msg:orderedMessages (:m001 :m002 :m003 :m004 :m005) .
18
18
  :temperatureFlow msg:message :m001 .
19
19
  :temperatureFlow msg:message :m002 .
@@ -23,33 +23,33 @@
23
23
  :temperatureFlow :pipeline (:ingest :validate :interpret :route :sink) .
24
24
  :temperatureFlow :highThreshold 26 .
25
25
  :m001 :atStage :ingest .
26
- :m001 rdf:type msg:RDFMessage .
26
+ :m001 a msg:RDFMessage .
27
27
  :m001 msg:offset 1 .
28
28
  :m001 msg:nextMessage :m002 .
29
29
  :m001 prov:generatedAtTime "2026-05-12T18:20:00Z" .
30
30
  :m001 msg:payloadKind :observation .
31
31
  :m001 msg:expectedResult 21 .
32
32
  :m001 msg:payload in:formula1 .
33
- :m002 rdf:type msg:RDFMessage .
33
+ :m002 a msg:RDFMessage .
34
34
  :m002 msg:offset 2 .
35
35
  :m002 msg:nextMessage :m003 .
36
36
  :m002 prov:generatedAtTime "2026-05-12T18:21:00Z" .
37
37
  :m002 msg:payloadKind :observation .
38
38
  :m002 msg:expectedResult 22 .
39
39
  :m002 msg:payload in:formula2 .
40
- :m003 rdf:type msg:RDFMessage .
40
+ :m003 a msg:RDFMessage .
41
41
  :m003 msg:offset 3 .
42
42
  :m003 msg:nextMessage :m004 .
43
43
  :m003 prov:generatedAtTime "2026-05-12T18:22:00Z" .
44
44
  :m003 msg:payloadKind :heartbeat .
45
- :m004 rdf:type msg:RDFMessage .
45
+ :m004 a msg:RDFMessage .
46
46
  :m004 msg:offset 4 .
47
47
  :m004 msg:nextMessage :m005 .
48
48
  :m004 prov:generatedAtTime "2026-05-12T18:23:00Z" .
49
49
  :m004 msg:payloadKind :observation .
50
50
  :m004 msg:expectedResult 28 .
51
51
  :m004 msg:payload in:formula3 .
52
- :m005 rdf:type msg:RDFMessage .
52
+ :m005 a msg:RDFMessage .
53
53
  :m005 msg:offset 5 .
54
54
  :m005 prov:generatedAtTime "2026-05-12T18:24:00Z" .
55
55
  :m005 msg:payloadKind :observation .
@@ -57,28 +57,28 @@
57
57
  :m005 msg:payload in:formula4 .
58
58
 
59
59
  in:formula1 {
60
- _:m001b0 rdf:type sosa:Observation .
60
+ _:m001b0 a sosa:Observation .
61
61
  _:m001b0 sosa:madeBySensor :thermometerA .
62
62
  _:m001b0 sosa:resultTime "2026-05-12T18:20:00Z" .
63
63
  _:m001b0 sosa:hasSimpleResult 21 .
64
64
  }
65
65
 
66
66
  in:formula2 {
67
- _:m002b0 rdf:type sosa:Observation .
67
+ _:m002b0 a sosa:Observation .
68
68
  _:m002b0 sosa:madeBySensor :thermometerA .
69
69
  _:m002b0 sosa:resultTime "2026-05-12T18:21:00Z" .
70
70
  _:m002b0 sosa:hasSimpleResult 22 .
71
71
  }
72
72
 
73
73
  in:formula3 {
74
- _:m004b0 rdf:type sosa:Observation .
74
+ _:m004b0 a sosa:Observation .
75
75
  _:m004b0 sosa:madeBySensor :thermometerA .
76
76
  _:m004b0 sosa:resultTime "2026-05-12T18:23:00Z" .
77
77
  _:m004b0 sosa:hasSimpleResult 28 .
78
78
  }
79
79
 
80
80
  in:formula4 {
81
- _:m005b0 rdf:type sosa:Observation .
81
+ _:m005b0 a sosa:Observation .
82
82
  _:m005b0 sosa:madeBySensor :thermometerA .
83
83
  _:m005b0 sosa:resultTime "2026-05-12T18:24:00Z" .
84
84
  _:m005b0 sosa:hasSimpleResult 29 .
@@ -13,25 +13,25 @@
13
13
  # Formal Eyeling input evidence in RDF 1.2 TriG.
14
14
  # The generated runner reads this TriG evidence directly.
15
15
 
16
- :temperatureLog rdf:type msg:MessageLog .
16
+ :temperatureLog a msg:MessageLog .
17
17
  :temperatureLog msg:orderedMessages (:m001 :m002 :m003) .
18
18
  :temperatureLog msg:message :m001 .
19
19
  :temperatureLog msg:message :m002 .
20
20
  :temperatureLog msg:message :m003 .
21
21
  :temperatureLog msg:profile :generatedAtTimeProfile .
22
22
  :temperatureLog msg:retentionPolicy "replayable archive" .
23
- :m001 rdf:type msg:RDFMessage .
23
+ :m001 a msg:RDFMessage .
24
24
  :m001 msg:offset 1 .
25
25
  :m001 prov:generatedAtTime "2026-05-12T18:20:00Z" .
26
26
  :m001 msg:payloadKind :observation .
27
27
  :m001 msg:localBlankLabel "_:b0" .
28
28
  :m001 msg:expectedResult 22 .
29
29
  :m001 msg:payload in:formula1 .
30
- :m002 rdf:type msg:RDFMessage .
30
+ :m002 a msg:RDFMessage .
31
31
  :m002 msg:offset 2 .
32
32
  :m002 prov:generatedAtTime "2026-05-12T18:22:00Z" .
33
33
  :m002 msg:payloadKind :heartbeat .
34
- :m003 rdf:type msg:RDFMessage .
34
+ :m003 a msg:RDFMessage .
35
35
  :m003 msg:offset 3 .
36
36
  :m003 prov:generatedAtTime "2026-05-12T18:25:00Z" .
37
37
  :m003 msg:payloadKind :observation .
@@ -40,14 +40,14 @@
40
40
  :m003 msg:payload in:formula2 .
41
41
 
42
42
  in:formula1 {
43
- _:m001b0 rdf:type sosa:Observation .
43
+ _:m001b0 a sosa:Observation .
44
44
  _:m001b0 sosa:madeBySensor :thermometerA .
45
45
  _:m001b0 sosa:resultTime "2026-05-12T18:20:00Z" .
46
46
  _:m001b0 sosa:hasSimpleResult 22 .
47
47
  }
48
48
 
49
49
  in:formula2 {
50
- _:m003b0 rdf:type sosa:Observation .
50
+ _:m003b0 a sosa:Observation .
51
51
  _:m003b0 sosa:madeBySensor :thermometerA .
52
52
  _:m003b0 sosa:resultTime "2026-05-12T18:25:00Z" .
53
53
  _:m003b0 sosa:hasSimpleResult 23 .
@@ -14,6 +14,8 @@
14
14
  @prefix math: <http://www.w3.org/2000/10/swap/math#>.
15
15
  @prefix log: <http://www.w3.org/2000/10/swap/log#>.
16
16
 
17
+ "000" log:outputString "# interop-demo\n\n" .
18
+
17
19
  # ---------------------------------------------
18
20
  # 1) Three independent apps (different schemas)
19
21
  # ---------------------------------------------
@@ -101,6 +103,6 @@
101
103
  ?c ex:recommendedAction ex:ApplyGoldDiscountAndSendInvoiceReminder.
102
104
 
103
105
  # Optional ordered console output for eyeling
104
- "001" log:outputString "ACTION: apply GoldDiscount and send invoice reminder (opt-in confirmed).".
106
+ "001" log:outputString "ACTION: apply GoldDiscount and send invoice reminder (opt-in confirmed).\n".
105
107
  }.
106
108
 
@@ -241,9 +241,9 @@
241
241
  }
242
242
  =>
243
243
  {
244
- :s01 log:outputString "=== Answer ===\n" .
244
+ :s01 log:outputString "# matrix-mechanics\n\n## Answer\n" .
245
245
  :s02 log:outputString ?txt .
246
- :s03 log:outputString "\n\n=== Reason Why ===\n" .
246
+ :s03 log:outputString "\n\n## Reason Why\n" .
247
247
  } .
248
248
 
249
249
  {
@@ -301,7 +301,7 @@
301
301
  }
302
302
  =>
303
303
  {
304
- :s09 log:outputString "\n=== Check ===\n" .
304
+ :s09 log:outputString "\n## Check\n" .
305
305
  } .
306
306
 
307
307
  {
@@ -366,7 +366,7 @@
366
366
  # ARC rendering through log:outputString
367
367
  # --------------------------------------
368
368
 
369
- :out01 log:outputString "=== Answer ===\n" .
369
+ :out01 log:outputString "# medior\n\n## Answer\n" .
370
370
  :out02 log:outputString "Name: Medior\n" .
371
371
  :out03 log:outputString "Region: Flanders\n" .
372
372
  :out04 log:outputString "Metric: post_discharge_coordination_priority\n" .
@@ -387,7 +387,7 @@
387
387
  ("Envelope HMAC-SHA-256: %s\n" ?sig) string:format ?line .
388
388
  } => { :out10 log:outputString ?line . } .
389
389
 
390
- :out11 log:outputString "\n=== Reason Why ===\n" .
390
+ :out11 log:outputString "\n## Reason Why\n" .
391
391
  :out12 log:outputString "RenalSafetyConcern holds because eGFR = 52 and the threshold is < 60.\n" .
392
392
  :out13 log:outputString "PolypharmacyRisk holds because the active medication count is 9 and the threshold is ≥ 8.\n" .
393
393
  :out14 log:outputString "ReadmissionHistory holds because admissionsLast180Days = 2 and the threshold is ≥ 1.\n" .
@@ -396,7 +396,7 @@
396
396
  :out17 log:outputString "The selected package is \"Medior Continuity Pulse\" with cost €4, touches=3.\n" .
397
397
  :out18 log:outputString "Use is permitted only for purpose \"care_coordination\" and expires at 2026-04-11T08:00:00+00:00.\n" .
398
398
 
399
- :out19 log:outputString "\n=== Check ===\n" .
399
+ :out19 log:outputString "\n## Check\n" .
400
400
  { :check :payloadHashMatches true . }
401
401
  => { :out20 log:outputString "- PASS: payloadHashMatches\n" . } .
402
402
  { :check :signatureVerifies true . }
@@ -116,3 +116,8 @@ log:query
116
116
  {
117
117
  :report :aliceReaches ?Who.
118
118
  }.
119
+
120
+
121
+ # Markdown rendering via log:outputString.
122
+ :__md_output :text "# n3-speaks-for-itself\n\n@prefix : <https://example.org/n3-speaks#> .\n@prefix foaf: <http://xmlns.com/foaf/0.1/> .\n@prefix id: <https://example.org/id/> .\n\n:report :aliceReaches id:bob .\n:report :aliceReaches id:carol .\n:report :aliceReaches id:dave .\n:report :believes {\n id:alice foaf:knows id:bob .\n} .\n:report :believes {\n id:alice foaf:name \"Alice\" .\n} .\n:report :believes {\n id:bob foaf:knows id:carol .\n} .\n:report :believes {\n id:bob foaf:name \"Bob\" .\n} .\n:report :believes {\n id:carol foaf:knows id:dave .\n} .\n:report :believes {\n id:carol foaf:name \"Carol\" .\n} .\n:report :believes {\n id:dave foaf:name \"Dave\" .\n} .\n:report :trusts <https://alice.example/profile.n3> .\n:report :trusts <https://bob.example/profile.n3> .\n:report :trusts <https://carol.example/profile.n3> .\n{\n id:alice foaf:knows id:bob .\n} :believedFromDoc <https://alice.example/profile.n3> .\n{\n id:alice foaf:name \"Alice\" .\n} :believedFromDoc <https://alice.example/profile.n3> .\n{\n id:bob foaf:knows id:carol .\n} :believedFromDoc <https://bob.example/profile.n3> .\n{\n id:bob foaf:name \"Bob\" .\n} :believedFromDoc <https://bob.example/profile.n3> .\n{\n id:carol foaf:knows id:dave .\n} :believedFromDoc <https://carol.example/profile.n3> .\n{\n id:carol foaf:name \"Carol\" .\n} :believedFromDoc <https://carol.example/profile.n3> .\n{\n id:dave foaf:name \"Dave\" .\n} :believedFromDoc <https://carol.example/profile.n3> .\n" .
123
+ { :__md_output :text ?text } log:query { :__md_output log:outputString ?text } .
@@ -410,7 +410,7 @@
410
410
  {
411
411
  :AgreementEHDS1 dct:title ?alabel .
412
412
  :PatientProfileExample dct:title ?plabel .
413
- ( "\n=== Ranked DPV Risk Report (EHDS-aligned) ===\nAgreement: %s\nProfile: %s\n\n"
413
+ ( "# odrl-dpv-ehds-risk-ranked\n\n## Ranked DPV Risk Report (EHDS-aligned)\nAgreement: %s\nProfile: %s\n\n"
414
414
  ?alabel ?plabel ) string:format ?hdr .
415
415
  }
416
416
  log:query
@@ -527,7 +527,7 @@
527
527
  {
528
528
  :AgreementHC1 dct:title ?alabel .
529
529
  :PatientExample dct:title ?plabel .
530
- ( "\n=== Ranked DPV Risk Report (Healthcare & Life Sciences) ===\nAgreement: %s\nProfile: %s\n\n"
530
+ ( "# odrl-dpv-healthcare-risk-ranked\n\n## Ranked DPV Risk Report (Healthcare & Life Sciences)\nAgreement: %s\nProfile: %s\n\n"
531
531
  ?alabel ?plabel ) string:format ?hdr .
532
532
  }
533
533
  =>
@@ -412,7 +412,7 @@
412
412
  {
413
413
  :Agreement1 dct:title ?alabel .
414
414
  :ConsumerExample dct:title ?plabel .
415
- ( "\n=== Ranked DPV Risk Report ===\nAgreement: %s\nProfile: %s\n\n"
415
+ ( "# odrl-dpv-risk-ranked\n\n## Ranked DPV Risk Report\nAgreement: %s\nProfile: %s\n\n"
416
416
  ?alabel ?plabel ) string:format ?hdr .
417
417
  }
418
418
  log:query
@@ -773,7 +773,7 @@
773
773
  {
774
774
  ?agreement a :Agreement; :label ?alabel.
775
775
  ?profile a :ConsumerProfile; :label ?plabel.
776
- ( "\n=== Risk report for %s (profile: %s) ===\n" ?alabel ?plabel ) string:format ?hdr.
776
+ ( "# odrl-risk-mitigation\n\n## Risk report for %s (profile: %s)\n" ?alabel ?plabel ) string:format ?hdr.
777
777
  }
778
778
  =>
779
779
  {
@@ -391,7 +391,7 @@
391
391
  ?agreement a :Agreement; :label ?alabel.
392
392
  ?profile a :ConsumerProfile; :label ?plabel.
393
393
 
394
- ( "\n=== Risk report for %s (profile: %s) ===\n" ?alabel ?plabel ) string:format ?hdr.
394
+ ( "# odrl-risk\n\n## Risk report for %s (profile: %s)\n" ?alabel ?plabel ) string:format ?hdr.
395
395
  }
396
396
  =>
397
397
  {
@@ -1,20 +1,22 @@
1
- ACT harbor alarm bit interoperability
1
+ # act-alarm-bit-interoperability
2
2
 
3
- Answer
4
- YES for the classical alarm bit.
5
- NO for universal cloning and unrestricted fan-out of the quantum-like token.
3
+ ACT harbor alarm bit interoperability
6
4
 
7
- Reason Why
8
- The alarm state is modeled as an abstract bit carried by two unlike classical substrates. Because both the optical beacon and the relay register are information media for the same variable, local permutation and copying in both directions are possible. By contrast, the quantum-like token is treated as a superinformation medium, so universal cloning of all of its states is impossible, and unrestricted classical-style fan-out is blocked as well.
5
+ Answer
6
+ YES for the classical alarm bit.
7
+ NO for universal cloning and unrestricted fan-out of the quantum-like token.
9
8
 
10
- Check
11
- C1 OK - the optical beacon is an information medium
12
- C2 OK - the relay register is an information medium
13
- C3 OK - both substrates encode the same abstract variable: AlarmBit
14
- C4 OK - AlarmBit can be copied from optical beacon to relay register
15
- C5 OK - AlarmBit can be copied from relay register to optical beacon
16
- C6 OK - local permutation of AlarmBit is possible on the optical beacon
17
- C7 OK - local permutation of AlarmBit is possible on the relay register
18
- C8 OK - cloning all states of the quantum token is an impossible task
19
- C9 OK - the quantum token cannot be universally cloned
20
- C10 OK - the quantum token cannot support unrestricted classical-style fan-out
9
+ Reason Why
10
+ The alarm state is modeled as an abstract bit carried by two unlike classical substrates. Because both the optical beacon and the relay register are information media for the same variable, local permutation and copying in both directions are possible. By contrast, the quantum-like token is treated as a superinformation medium, so universal cloning of all of its states is impossible, and unrestricted classical-style fan-out is blocked as well.
11
+
12
+ Check
13
+ C1 OK - the optical beacon is an information medium
14
+ C2 OK - the relay register is an information medium
15
+ C3 OK - both substrates encode the same abstract variable: AlarmBit
16
+ C4 OK - AlarmBit can be copied from optical beacon to relay register
17
+ C5 OK - AlarmBit can be copied from relay register to optical beacon
18
+ C6 OK - local permutation of AlarmBit is possible on the optical beacon
19
+ C7 OK - local permutation of AlarmBit is possible on the relay register
20
+ C8 OK - cloning all states of the quantum token is an impossible task
21
+ C9 OK - the quantum token cannot be universally cloned
22
+ C10 OK - the quantum token cannot support unrestricted classical-style fan-out
@@ -0,0 +1,27 @@
1
+ # act-barley-seed-lineage
2
+
3
+ ACT barley seed lineage — can and can't
4
+
5
+ Answer
6
+ YES for the viable barley lineage.
7
+ NO for the contrast lineages when digital heredity, repair, protected dormancy, or heritable variation are missing.
8
+
9
+ Reason Why
10
+ The main lineage can achieve genome copying under no-design laws because its hereditary information is digitally instantiated. It can also pass through protected dormancy, germinate, produce propagules, reproduce accurately, close its life cycle, and adaptively persist under saline selection. But the contrast lineages show the "can't" side: non-digital heredity blocks accurate genome copying under no-design laws, lack of repair blocks accurate self-reproduction, lack of dormancy protection blocks lineage closure through a protected seed phase, and lack of heritable variation blocks adaptive evolution and thus blocks evolvability.
11
+
12
+ Check
13
+ C1 OK - no-design laws are assumed
14
+ C2 OK - the viable genome can be copied under no-design laws
15
+ C3 OK - the viable seed can achieve protected dormancy
16
+ C4 OK - the viable seed can germinate
17
+ C5 OK - the viable adult can produce propagules
18
+ C6 OK - the viable lineage can achieve accurate self-reproduction
19
+ C7 OK - the viable lineage can achieve lineage closure
20
+ C8 OK - the viable lineage can exhibit heritable variation
21
+ C9 OK - the viable lineage can adaptively persist
22
+ C10 OK - the viable lineage is evolvable
23
+ C11 OK - the non-digital lineage cannot achieve accurate self-reproduction
24
+ C12 OK - the repair-deficient lineage cannot achieve accurate self-reproduction
25
+ C13 OK - the coatless lineage cannot achieve lineage closure through protected dormancy
26
+ C14 OK - the static lineage cannot achieve adaptive evolution
27
+ C15 OK - the static lineage cannot be an evolvable lineage
@@ -1,22 +1,24 @@
1
- ACT docking abort token — constructor-theory coverage case
1
+ # act-docking-abort
2
2
 
3
- Answer
4
- YES for the classical abort token.
5
- NO for universal cloning and unrestricted audit fan-out of the quantum seal.
3
+ ACT docking abort token — constructor-theory coverage case
6
4
 
7
- Reason Why
8
- The docking-abort token is treated as an abstract information variable carried by unlike classical media: lamp state, PLC register, radio frame, and audit display. Because those substrates are information media for the same variable, the token can be permuted locally, cloned locally, copied across media, measured into an output record, and embedded in serial and parallel task networks. By contrast, the quantum authenticity seal is treated as a superinformation medium, so cloning all of its states is impossible and unrestricted audit fan-out is blocked.
5
+ Answer
6
+ YES for the classical abort token.
7
+ NO for universal cloning and unrestricted audit fan-out of the quantum seal.
9
8
 
10
- Check
11
- C1 OK - the abort lamp is a computation medium
12
- C2 OK - the abort lamp distinguishes the abort bit
13
- C3 OK - permutation of the abort bit is possible on the abort lamp
14
- C4 OK - local cloning of the abort bit is possible on the PLC register
15
- C5 OK - the abort bit can be copied from lamp to PLC
16
- C6 OK - the abort bit can be copied from PLC to radio frame
17
- C7 OK - the abort bit can be measured from radio frame into the audit display
18
- C8 OK - a serial network from lamp via PLC to audit display is possible
19
- C9 OK - a parallel network from PLC to radio frame and audit display is possible
20
- C10 OK - cloning all states of the quantum seal is an impossible task
21
- C11 OK - the quantum seal cannot be universally cloned
22
- C12 OK - the quantum seal cannot be used for unrestricted audit fan-out
9
+ Reason Why
10
+ The docking-abort token is treated as an abstract information variable carried by unlike classical media: lamp state, PLC register, radio frame, and audit display. Because those substrates are information media for the same variable, the token can be permuted locally, cloned locally, copied across media, measured into an output record, and embedded in serial and parallel task networks. By contrast, the quantum authenticity seal is treated as a superinformation medium, so cloning all of its states is impossible and unrestricted audit fan-out is blocked.
11
+
12
+ Check
13
+ C1 OK - the abort lamp is a computation medium
14
+ C2 OK - the abort lamp distinguishes the abort bit
15
+ C3 OK - permutation of the abort bit is possible on the abort lamp
16
+ C4 OK - local cloning of the abort bit is possible on the PLC register
17
+ C5 OK - the abort bit can be copied from lamp to PLC
18
+ C6 OK - the abort bit can be copied from PLC to radio frame
19
+ C7 OK - the abort bit can be measured from radio frame into the audit display
20
+ C8 OK - a serial network from lamp via PLC to audit display is possible
21
+ C9 OK - a parallel network from PLC to radio frame and audit display is possible
22
+ C10 OK - cloning all states of the quantum seal is an impossible task
23
+ C11 OK - the quantum seal cannot be universally cloned
24
+ C12 OK - the quantum seal cannot be used for unrestricted audit fan-out
@@ -1,24 +1,26 @@
1
- ACT gravity mediator witness
1
+ # act-gravity-mediator-witness
2
2
 
3
- Answer
4
- YES for the mediator-only witness run.
5
- NO for a purely classical mediator model under the same mediator-only conditions.
3
+ ACT gravity mediator witness
6
4
 
7
- Reason Why
8
- The positive run assumes locality and interoperability, excludes direct coupling between the two quantum systems, and records an entanglement witness after interaction through the mediator alone. Under those constructor-theoretic conditions, the mediator must be non-classical, so the run rules out a purely classical mediator model. The contrast run keeps the same locality, interoperability, and mediator-only structure but assigns the mediator a purely classical model. In that case the mediator-only entanglement witness is blocked, so the run cannot support the same non-classicality conclusion.
5
+ Answer
6
+ YES for the mediator-only witness run.
7
+ NO for a purely classical mediator model under the same mediator-only conditions.
9
8
 
10
- Check
11
- C1 OK - locality is assumed in the positive run
12
- C2 OK - interoperability is assumed in the positive run
13
- C3 OK - direct coupling between the two quantum systems is excluded
14
- C4 OK - the positive run has a mediator-only interaction path
15
- C5 OK - an entanglement witness is observed in the positive run
16
- C6 OK - the positive run supports an information-transfer interface
17
- C7 OK - the positive run supports local readout
18
- C8 OK - the positive mediator is derived to be non-classical
19
- C9 OK - a purely classical mediator model is ruled out by the positive run
20
- C10 OK - the non-classicality conclusion applies to the gravitational mediator
21
- C11 OK - the contrast run is also mediator-only
22
- C12 OK - the contrast run cannot support a mediator-only entanglement witness
23
- C13 OK - the purely classical gravitational mediator cannot mediate entanglement under the witness conditions
24
- C14 OK - the contrast run cannot support the non-classicality conclusion
9
+ Reason Why
10
+ The positive run assumes locality and interoperability, excludes direct coupling between the two quantum systems, and records an entanglement witness after interaction through the mediator alone. Under those constructor-theoretic conditions, the mediator must be non-classical, so the run rules out a purely classical mediator model. The contrast run keeps the same locality, interoperability, and mediator-only structure but assigns the mediator a purely classical model. In that case the mediator-only entanglement witness is blocked, so the run cannot support the same non-classicality conclusion.
11
+
12
+ Check
13
+ C1 OK - locality is assumed in the positive run
14
+ C2 OK - interoperability is assumed in the positive run
15
+ C3 OK - direct coupling between the two quantum systems is excluded
16
+ C4 OK - the positive run has a mediator-only interaction path
17
+ C5 OK - an entanglement witness is observed in the positive run
18
+ C6 OK - the positive run supports an information-transfer interface
19
+ C7 OK - the positive run supports local readout
20
+ C8 OK - the positive mediator is derived to be non-classical
21
+ C9 OK - a purely classical mediator model is ruled out by the positive run
22
+ C10 OK - the non-classicality conclusion applies to the gravitational mediator
23
+ C11 OK - the contrast run is also mediator-only
24
+ C12 OK - the contrast run cannot support a mediator-only entanglement witness
25
+ C13 OK - the purely classical gravitational mediator cannot mediate entanglement under the witness conditions
26
+ C14 OK - the contrast run cannot support the non-classicality conclusion
@@ -1,27 +1,29 @@
1
- ACT isolation-breach token — broad constructor-theory coverage case
1
+ # act-isolation-breach
2
2
 
3
- Answer
4
- YES for the classical isolation-breach token.
5
- NO for universal cloning and unrestricted fan-out of the quantum provenance seal.
3
+ ACT isolation-breach token — broad constructor-theory coverage case
6
4
 
7
- Reason Why
8
- The isolation-breach token is treated as an abstract information variable carried by unlike classical media: a door beacon, a containment PLC, a nurse pager, and an incident board. Because those substrates are information media for the same variable, the token can be prepared, permuted, reversed, cloned locally, copied across media, measured into an output record, and composed into serial and parallel task networks. By contrast, the specimen seal is treated as a superinformation medium, so cloning all of its states is impossible and unrestricted parallel fan-out is blocked.
5
+ Answer
6
+ YES for the classical isolation-breach token.
7
+ NO for universal cloning and unrestricted fan-out of the quantum provenance seal.
9
8
 
10
- Check
11
- C1 OK - the door beacon is an information medium
12
- C2 OK - the containment PLC is an information medium
13
- C3 OK - the nurse pager is an information medium
14
- C4 OK - the incident board is an information medium
15
- C5 OK - the door beacon distinguishes the breach bit
16
- C6 OK - the breach state can be prepared on the nurse pager
17
- C7 OK - permutation from safe to breach is possible on the door beacon
18
- C8 OK - the door beacon supports reversible permutation
19
- C9 OK - local cloning of the breach bit is possible on the containment PLC
20
- C10 OK - the breach bit can be copied from door beacon to containment PLC
21
- C11 OK - the breach bit can be copied from containment PLC to nurse pager
22
- C12 OK - the breach bit can be measured from nurse pager into the incident board
23
- C13 OK - a serial network from door beacon via containment PLC to incident board is possible
24
- C14 OK - a parallel network from containment PLC to nurse pager and incident board is possible
25
- C15 OK - cloning all states of the specimen seal is an impossible task
26
- C16 OK - the specimen seal cannot be universally cloned
27
- C17 OK - the specimen seal cannot support unrestricted parallel fan-out
9
+ Reason Why
10
+ The isolation-breach token is treated as an abstract information variable carried by unlike classical media: a door beacon, a containment PLC, a nurse pager, and an incident board. Because those substrates are information media for the same variable, the token can be prepared, permuted, reversed, cloned locally, copied across media, measured into an output record, and composed into serial and parallel task networks. By contrast, the specimen seal is treated as a superinformation medium, so cloning all of its states is impossible and unrestricted parallel fan-out is blocked.
11
+
12
+ Check
13
+ C1 OK - the door beacon is an information medium
14
+ C2 OK - the containment PLC is an information medium
15
+ C3 OK - the nurse pager is an information medium
16
+ C4 OK - the incident board is an information medium
17
+ C5 OK - the door beacon distinguishes the breach bit
18
+ C6 OK - the breach state can be prepared on the nurse pager
19
+ C7 OK - permutation from safe to breach is possible on the door beacon
20
+ C8 OK - the door beacon supports reversible permutation
21
+ C9 OK - local cloning of the breach bit is possible on the containment PLC
22
+ C10 OK - the breach bit can be copied from door beacon to containment PLC
23
+ C11 OK - the breach bit can be copied from containment PLC to nurse pager
24
+ C12 OK - the breach bit can be measured from nurse pager into the incident board
25
+ C13 OK - a serial network from door beacon via containment PLC to incident board is possible
26
+ C14 OK - a parallel network from containment PLC to nurse pager and incident board is possible
27
+ C15 OK - cloning all states of the specimen seal is an impossible task
28
+ C16 OK - the specimen seal cannot be universally cloned
29
+ C17 OK - the specimen seal cannot support unrestricted parallel fan-out
@@ -1,20 +1,22 @@
1
- ACT photosynthetic exciton transfer
1
+ # act-photosynthetic-exciton-transfer
2
2
 
3
- Answer
4
- YES for the tuned antenna complex.
5
- NO for the detuned, strongly decohered contrast complex.
3
+ ACT photosynthetic exciton transfer
6
4
 
7
- Reason Why
8
- The tuned complex can sample exciton pathways coherently, use vibronically assisted transfer, and exploit short-lived quantum assistance along a downhill route to the reaction center. That makes efficient exciton transfer and reaction-center delivery possible in this case. The detuned contrast complex lacks the same alignment: coherent pathway sampling is blocked, vibronic assistance is unavailable, and the energy landscape is mismatched, so efficient reaction-center delivery is not possible in the same operating picture.
5
+ Answer
6
+ YES for the tuned antenna complex.
7
+ NO for the detuned, strongly decohered contrast complex.
9
8
 
10
- Check
11
- C1 OK - the tuned complex can sample exciton pathways coherently
12
- C2 OK - the tuned complex can use vibronically assisted transfer
13
- C3 OK - short-lived quantum assistance is enough in the tuned downhill regime
14
- C4 OK - efficient exciton transfer is possible in the tuned complex
15
- C5 OK - the tuned complex can deliver excitation to the reaction center
16
- C6 OK - the detuned complex cannot sample pathways coherently
17
- C7 OK - the detuned complex cannot use vibronically assisted transfer
18
- C8 OK - the detuned complex cannot achieve directed reaction-center transfer
19
- C9 OK - the detuned complex cannot achieve efficient exciton transfer
20
- C10 OK - the detuned complex cannot deliver excitation efficiently to the reaction center
9
+ Reason Why
10
+ The tuned complex can sample exciton pathways coherently, use vibronically assisted transfer, and exploit short-lived quantum assistance along a downhill route to the reaction center. That makes efficient exciton transfer and reaction-center delivery possible in this case. The detuned contrast complex lacks the same alignment: coherent pathway sampling is blocked, vibronic assistance is unavailable, and the energy landscape is mismatched, so efficient reaction-center delivery is not possible in the same operating picture.
11
+
12
+ Check
13
+ C1 OK - the tuned complex can sample exciton pathways coherently
14
+ C2 OK - the tuned complex can use vibronically assisted transfer
15
+ C3 OK - short-lived quantum assistance is enough in the tuned downhill regime
16
+ C4 OK - efficient exciton transfer is possible in the tuned complex
17
+ C5 OK - the tuned complex can deliver excitation to the reaction center
18
+ C6 OK - the detuned complex cannot sample pathways coherently
19
+ C7 OK - the detuned complex cannot use vibronically assisted transfer
20
+ C8 OK - the detuned complex cannot achieve directed reaction-center transfer
21
+ C9 OK - the detuned complex cannot achieve efficient exciton transfer
22
+ C10 OK - the detuned complex cannot deliver excitation efficiently to the reaction center
@@ -1,20 +1,22 @@
1
- ACT sensor memory reset
1
+ # act-sensor-memory-reset
2
2
 
3
- Answer
4
- YES with the battery pack.
5
- NO with the ambient heat bath alone.
3
+ ACT sensor memory reset
6
4
 
7
- Reason Why
8
- The alarm latch is a one-bit memory that must be reset to its standard clear state before the radiation sensor can be reused. In this case, the charged battery pack is treated as a work medium, so it can drive a controlled reset and prepare the latch in its reusable standard state. The ambient bath is treated as a heat medium, so by itself it cannot perform the same reliable directed reset. The example also shows an irreversibility pattern: useful work can be degraded into dissipated heat during reset, but the ambient heat bath alone cannot reconstruct the charged work resource.
5
+ Answer
6
+ YES with the battery pack.
7
+ NO with the ambient heat bath alone.
9
8
 
10
- Check
11
- C1 OK - the battery pack can drive a controlled reset
12
- C2 OK - the alarm latch can be reliably reset from work
13
- C3 OK - the latch can be prepared in its standard reusable state
14
- C4 OK - the sensor can be made ready for reuse
15
- C5 OK - the work resource can degrade to heat during reset
16
- C6 OK - the ambient heat bath cannot drive a controlled reset
17
- C7 OK - the latch cannot be reliably reset from heat alone
18
- C8 OK - the latch cannot be prepared in its standard state from heat alone
19
- C9 OK - the sensor cannot be made ready for reuse from heat alone
20
- C10 OK - the ambient heat bath cannot reconstruct the charged work resource by itself
9
+ Reason Why
10
+ The alarm latch is a one-bit memory that must be reset to its standard clear state before the radiation sensor can be reused. In this case, the charged battery pack is treated as a work medium, so it can drive a controlled reset and prepare the latch in its reusable standard state. The ambient bath is treated as a heat medium, so by itself it cannot perform the same reliable directed reset. The example also shows an irreversibility pattern: useful work can be degraded into dissipated heat during reset, but the ambient heat bath alone cannot reconstruct the charged work resource.
11
+
12
+ Check
13
+ C1 OK - the battery pack can drive a controlled reset
14
+ C2 OK - the alarm latch can be reliably reset from work
15
+ C3 OK - the latch can be prepared in its standard reusable state
16
+ C4 OK - the sensor can be made ready for reuse
17
+ C5 OK - the work resource can degrade to heat during reset
18
+ C6 OK - the ambient heat bath cannot drive a controlled reset
19
+ C7 OK - the latch cannot be reliably reset from heat alone
20
+ C8 OK - the latch cannot be prepared in its standard state from heat alone
21
+ C9 OK - the sensor cannot be made ready for reuse from heat alone
22
+ C10 OK - the ambient heat bath cannot reconstruct the charged work resource by itself