News for hackers. Stuff that matters.
Re:The Seven Deadly Sins of AI Predictions by ScottBurson on Sunday October 08, 2017 @08:31PM (#15430805)
> all computational systems are axiomatic systems

Whatever gave you that idea?

Re:The Seven Deadly Sins of AI Predictions by yters on Sunday October 08, 2017 @09:31PM (#15431045)
They cannot be more capable of proving Kolmogorov complexity than an axiomatic system.
Re:The Seven Deadly Sins of AI Predictions by yters on Monday October 09, 2017 @12:09AM (#15431522)
Also the Curry-Howard correspondence.
Re:The Seven Deadly Sins of AI Predictions by red75prime on Monday October 09, 2017 @05:24AM (#15432455)
Citation from https://en.wikibooks.org/wiki/Haskell/The_Curry%E2%80%93Howa...

"[...] we can prove any theorem using Haskell types because every type is inhabited. Therefore, Haskell's type system actually corresponds to an inconsistent logic system."

Thus Haskell programs in general don't correspond to a consistent axiomatic system, which provides counterexample to your statement. Rebuttal complete.

Re:The Seven Deadly Sins of AI Predictions by yters on Monday October 09, 2017 @10:57AM (#15434291)
Inconsistent systems cannot prove Kolmogorov complexity limits. What's your point?
Re:The Seven Deadly Sins of AI Predictions by red75prime on Monday October 09, 2017 @01:24PM (#15435697)
Inconsistent axiomatic systems can prove anything. Thus either Haskell programs can prove the limits (and prove the opposite statement, as they are inconsistent) or they aren't axiomatic system as you mean it. Both possibilities contradict your statement:

> Chaitin's incompleteness theorem mean AI cannot learn

Re:The Seven Deadly Sins of AI Predictions by yters on Monday October 09, 2017 @01:37PM (#15435815)
If programs are not axiomatic systems, then they cannot learn, period. Only ones that have consistent axioms have a hope of learning, and even then it is severely limited.
Re:The Seven Deadly Sins of AI Predictions by yters on Monday October 09, 2017 @01:30PM (#15435745)
Inconsistent axioms can provide a valid proof of Kolmogorov complexity, but not a sound one. Thinking a false statement is true is not learning.