code wiki / (root) / nx_paradigm_neurosymbolic_gate.nx

nx_paradigm_neurosymbolic_gate.nx

buildroot/runtime/nx_paradigm_neurosymbolic_gate.nx

5722 B75 linesdepth 3pulls 3 transitivereach 0 importersview sourcekind gate/prooftopic paradigm
docsdependenciesstructsconstsfunctions

about

nx_paradigm_neurosymbolic_gate.nx -- honest cycle on NEUROSYMBOLIC (dismissed GOFAI returning), map #3. Hypothesis (testable): a SYMBOLIC verifier catches errors an APPROXIMATE ("neural") solver makes -> higher reliability. Independent reference: the exact answer. Discipline (find where it FAILS): symbolic checking only pays when the problem has CHEAP CHECKABLE STRUCTURE. Verifiable problem = isqrt (s^2<=N<(s+1)^2, a cheap exact check) -> verifier catches + re-solves every error. NON-verifiable problem = estimate-average (the only "check" is recomputing the true average = the work you were approximating) -> symbolic adds NOTHING. Record the regime where neurosymbolic pays, honestly. No hw writes (Rule 26). expect_exit: 0 tier: ORIGINAL

dependencies 2 imports · 0 importers

nx_syscalls.nx nx_gate_verdict.nx nx_paradigm_neurosymbolic_gate

imports: nx_syscalls.nxnx_gate_verdict.nx

imported by: nobody (leaf or entry point)

call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown

main ns_puts sys_write sys_mmap isqrt v_isqrt ns_num sys_mmap ↻ sys_write ↻ gv_ctr sys_mmap ↻ gv_verdict gv_puts sys_write ↻ gv_num sys_mmap ↻ sys_write ↻ sys_munmap gv_journal sys_openat_append sys_mmap ↻ gv_catn sys_mmap ↻ sys_munmap ↻ sys_now_realtime_sec sys_mmap ↻ sys_clock_gettime_real gv_cat sys_write ↻ sys_close sys_munmap ↻ sys_exit

structs

none

consts

none

functions

11func ns_puts(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 }
called by 1: main calls 1: sys_write
12func ns_num(v: i64) -> i64 { let b: *u8=sys_mmap(28); var m: i64=v; if m<0{m=0-m;sys_write(1,"-" as *u8,1)} let t: *u8=sys_mmap(28); var k: i64=0; if m==0{t[0]=48 as u8;k=1} while m>0{t[k]=(48+(m%10)) as u8;m=m/10;k=k+1} var i: i64=0; while i<k{b[i]=t[k-1-i];i=i+1} sys_write(1,b,k); return 0 }
called by 1: main calls 2: sys_mmapsys_write
13func isqrt(v: i64) -> i64 { if v<=0 { return 0 } if v<4 { return 1 } var x: i64=v; var y: i64=(x+1)>>1; var go: i64=1; while go==1 { if y<x { x=y; y=(x+v/x)>>1 } else { go=0 } } return x }
called by 1: main
14func v_isqrt(v: i64, s: i64) -> i64 { if s*s>v { return 0 } if (s+1)*(s+1)<=v { return 0 } return 1 } // cheap exact CHECK
called by 1: main
16func main() -> i64
calls 8: ns_putssys_mmapisqrtv_isqrtns_numgv_ctr+2