<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0">
  <channel>
    <title>connectionism</title>
    <link>http://popups.lib.uliege.be/1373-5411/index.php?id=3640</link>
    <description>Index terms</description>
    <language>fr</language>
    <ttl>0</ttl>
    <item>
      <title>Problem solving based on error minimization in cellular systems with phase fields instead of connections</title>
      <link>http://popups.lib.uliege.be/1373-5411/index.php?id=3637</link>
      <description>It is explained how a cellular automaton can grow patterns that correspond to trained networks. Since a pattern corresponds to a map between an n-dimensional and an m-dimensional space, such a pattern can be called a 'meta-pattern'. The problems solved by connectionist multi-layered networks can be solved by the automaton too. In addition, it allows for a straightforward representation of patterns with internal bindings, even if such bindings are organized at several, hierarchically related levels. Further, if a problem has symmetry, then the form corresponding to its solution usually is aesthetically attractive. This contrasts with the black-box nature attributed to the classical connectionist approach. Since problems with symmetry are often called 'beautiful problems', the present system gives beautiful solutions for beautiful problems. </description>
      <pubDate>Thu, 26 Sep 2024 10:28:56 +0200</pubDate>
      <lastBuildDate>Thu, 26 Sep 2024 10:29:10 +0200</lastBuildDate>
      <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=3637</guid>
    </item>
  </channel>
</rss>