V_V comments on Botworld: a cellular automaton for studying self-modifying agents embedded in their environment - LessWrong

50 Post author: So8res 12 April 2014 12:56AM

You are viewing a comment permalink. View the original post to see all comments and the full post content.

Article Navigation

Comments (54)

Comments (54)

You are viewing a single comment's thread. Show more comments above.

Comment author: V_V 13 April 2014 10:50:30AM *  0 points [-]

I appreciate the effort, but you want to study agent that solve problem by using mutual program analysis and self-modification (in the form of generating different successors). Will come up with non-trivial examples where such strategies pay off in your simulator?
It seems quite hard to me. Due to technical limitations, anything involving automated theorem proving or complex planning is going to be off the table.

Comment author: So8res 13 April 2014 04:26:56PM 1 point [-]

From the technical report:

In this report, the register machines use a very simple instruction set which we call the constree language. A full implementation can be found in Appendix B. However, when modelling concrete decision problems in Botworld, we may choose to replace this simple language by something easier to use. (In particular, many robot programs will need to reason about Botworld's laws. Encoding Botworld into the constree language is no trivial task.)

Comment author: V_V 13 April 2014 05:09:07PM 1 point [-]

So next version will accept robot programs written in Coq, I suppose ;)

Powered by Reddit Powered by Reddit