[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/sci/ - Science & Math

Search:


View post   

>> No.16069281 [View]
File: 3.29 MB, 2100x2800, Argument resolved.png [View same] [iqdb] [saucenao] [google]
16069281

>>16067432
I was thinking more about MAID-LISP. If memory safety is just bounds checking when looking in an array/list/whatever and handling pointer dereference. MAID-LISP could probably be memory safe with some small changes.

Is there anything else for memory safety?

>>16068339
What would make it easier/nicer for working mathematicians?

>> No.16006813 [DELETED]  [View]
File: 3.29 MB, 2100x2800, Argument resolved.png [View same] [iqdb] [saucenao] [google]
16006813

>>16006614
I think the problem is that there is only so much redundancy that can get removed and once you remove it, that strategy no longer works.

>> No.15981832 [View]
File: 3.29 MB, 2100x2800, Argument resolved.png [View same] [iqdb] [saucenao] [google]
15981832

>>15981727
How could you have a number which is a counterexample but can't be proven to be one?

>>15981734
So, proving that something can't be proven true doesn't mean you also proved it can't be proven false? I thought unprovable was analogous to undecidable? If it is unprovable we can't determine truth value of the statement?

>>15981758
I was thinking if it is unprovable then it can't be proven true or false, and if some cases are known to be true, and it can't be proven false, then we have no counterexample because if there was a counterexample then it would be provably false and that contradicts with being unprovable. But if it is possible to have a counterexample that can't be proven to be a counterexample, this breaks my idea.

>>15981769
I have no idea what you are talking about.

Navigation
View posts[+24][+48][+96]