Hi, lkcl. That was your second mention to a non-NP-completeness of OpenSCAD language. What do you by that? I know the expression relative to problems and algorithms only. Ronaldo -- View this message in context: http://forum.openscad.org/Create-lightweight-latticed-designs-that-are-functionally-optimized-and-accurate-for-3D-printing-tp16279p16376.html Sent from the OpenSCAD mailing list archive at Nabble.com.

@Ronaldo The term NP-Complete comes from computability theory, and it applies to algorithms, not to languages. Ikcl is probably thinking of another term, "Turing complete", also from computability theory, which refers to the expressive power of a language. A language is Turing complete if you can write a program that simulates a Turing machine. OpenSCAD is Turing complete, since it has numbers, conditionals, lists and recursive functions. On 9 March 2016 at 12:25, Ronaldo <rcmpersiano@gmail.com> wrote: > Hi, lkcl. > > That was your second mention to a non-NP-completeness of OpenSCAD language. > What do you by that? I know the expression relative to problems and > algorithms only. > > Ronaldo > > > > -- > View this message in context: > http://forum.openscad.org/Create-lightweight-latticed-designs-that-are-functionally-optimized-and-accurate-for-3D-printing-tp16279p16376.html > Sent from the OpenSCAD mailing list archive at Nabble.com. > > _______________________________________________ > OpenSCAD mailing list > Discuss@lists.openscad.org > http://lists.openscad.org/mailman/listinfo/discuss_lists.openscad.org > > >

Thank you doug, this makes sense. -- View this message in context: http://forum.openscad.org/Create-lightweight-latticed-designs-that-are-functionally-optimized-and-accurate-for-3D-printing-tp16279p16378.html Sent from the OpenSCAD mailing list archive at Nabble.com.