{"id":505,"date":"2014-06-24T09:31:12","date_gmt":"2014-06-24T13:31:12","guid":{"rendered":"http:\/\/sites.hampshire.edu\/ci-lab\/?p=505"},"modified":"2014-06-24T09:31:12","modified_gmt":"2014-06-24T13:31:12","slug":"27-may-2014","status":"publish","type":"post","link":"https:\/\/sites.hampshire.edu\/ci-lab\/2014\/06\/24\/27-may-2014\/","title":{"rendered":"27 May 2014"},"content":{"rendered":"<h3>Present<\/h3>\n<p>Lee, Thom, Bill, George, Karthik, Omri (scribe)<\/p>\n<h3>Thom<\/h3>\n<p>Less than 2000 problem is important&#8211;why isn&#8217;t it easy?<\/p>\n<p>Thom has no time<\/p>\n<h3>Bill<\/h3>\n<p>Bill has set up lexicase in his system<\/p>\n<h3>Quantum stuff<\/h3>\n<p>George to work on minimal evoluationary loop:<br \/>\n1. Get comfortable with ClojureScript workflow<br \/>\n2. Manually try out some qgame programs<br \/>\n3. Generate random qgame programs<br \/>\n4. Very simple selection\/reproduction<\/p>\n<h3>TDS paper discussion<\/h3>\n<ul>\n<li>Can solve some pretty hard problems, but runs into an &#8220;exponential wall&#8221;&#8211;maybe GP could be really useful here<\/li>\n<li>Perhaps we should we write to the authors about non-binary test cases in GP (something they seem to have overlooked)<\/li>\n<li>Case order is manually optimized, whereas in lexicase order is randomized for each evaluation<\/li>\n<li>Raises the question: how do we deal with large numbers&#8211;potentially infinite&#8211;test cases?<\/li>\n<li>Their method has difficulty with arbitrary structure and instructions<\/li>\n<\/ul>\n<h3>Miscellany<\/h3>\n<p>There may be a workshop in Newfoundland with Wolfgang<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Present Lee, Thom, Bill, George, Karthik, Omri (scribe) Thom Less than 2000 problem is important&#8211;why isn&#8217;t it easy? Thom has no time Bill Bill has set up lexicase in his system Quantum stuff George to work on minimal evoluationary loop: 1. Get comfortable with ClojureScript workflow 2. Manually try out some qgame programs 3. Generate [&hellip;]<\/p>\n","protected":false},"author":637,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-505","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/posts\/505"}],"collection":[{"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/users\/637"}],"replies":[{"embeddable":true,"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/comments?post=505"}],"version-history":[{"count":1,"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/posts\/505\/revisions"}],"predecessor-version":[{"id":506,"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/posts\/505\/revisions\/506"}],"wp:attachment":[{"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/media?parent=505"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/categories?post=505"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/tags?post=505"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}