On Jan 21, 2008 6:17 AM, Ben Goertzel [EMAIL PROTECTED] wrote:
So, people do have a practically useful way of cheating problems in NP
now. Problem with AGI is, we don't know how to program it even given
computers with infinite computational power.
Well, that is wrong IMO AIXI and the
On Jan 20, 2008 10:17 PM, Ben Goertzel [EMAIL PROTECTED] wrote:
So, people do have a practically useful way of cheating problems in NP
now. Problem with AGI is, we don't know how to program it even given
computers with infinite computational power.
Well, that is wrong IMO AIXI and the
SMT in particular seems to have deep potential applicability.
To add a little background, SMT is under heavy developement at Microsoft
and it is planned to be applied a lot. The basic progress is that the
new version of
Z3 is an order of magnitude faster than the last one, and is even a
As far as I know there is little or no work done yet to integrate
probabilistic
reasoning with these solvers and it will probably not be easy to do it and
keep things efficient.
I don't think it will be easy, but what's intriguing is that it seems
like it might
be feasible-though-difficult
If I know you are against X, while X is not one of the s_i, but some
general description of it, how can you use the formula?
If the knowledge in a data compressor is all at the level of letter
string, how can it use the knowledge about the theme of a paper to
compress it better?
Pei
For
so: I will post a message on SAT, SMT and AGI
I would rephrase the question as: How would a pragmatically useful
polynomial time solution of logical satisfiability affect AGI?
---
I really appreciate that. I was surprised when I thought you were quashing
--- Pei Wang [EMAIL PROTECTED] wrote:
If I know you are against X, while X is not one of the s_i, but some
general description of it, how can you use the formula?
If you were compressing the message on topic X I {agree|disagree} and you
are predicting bit 2 (after compressing bits 7 through 3
will do so: I will post a message on SAT, SMT and AGI
And here it is:
However, I would rephrase the question as: How would a pragmatically useful
polynomial time solution of logical satisfiability affect AGI?
In fact, it's interesting to talk about how existing SAT and SMT solvers
http
On Jan 21, 2008 1:35 AM, Ben Goertzel [EMAIL PROTECTED] wrote:
However, I would rephrase the question as: How would a pragmatically useful
polynomial time solution of logical satisfiability affect AGI?
In fact, it's interesting to talk about how existing SAT and SMT solvers
On Jan 20, 2008 5:35 PM, Ben Goertzel [EMAIL PROTECTED] wrote:
In AGI, we don't care that much about worst-case complexity, nor even
necessarily about average-case complexity for very large N. We care mainly
about average-case complexity for realistic N and for the specific probability
So, people do have a practically useful way of cheating problems in NP
now. Problem with AGI is, we don't know how to program it even given
computers with infinite computational power.
Well, that is wrong IMO AIXI and the Godel Machine are provably correct
ways to achieve AGI with
11 matches
Mail list logo
