Y
Hacker News
new
|
ask
|
show
|
jobs
by
JohnHaugeland
1918 days ago
Behavior trees can be fully implemented in this language, and are a (fairly limited) subset of finite state machines
1 comments
Datenstrom
1918 days ago
I do not believe that is true. Pure FSMs are not Turing complete[1] while behavior trees can be made trivially so. BTs are not isomorphic to FSMs. I am not aware of any system that can be modeled in an FSM and not in a behavior tree.
[1]:
https://www.aaai.org/Papers/AIIDE/2008/AIIDE08-006.pdf
link
[1]: https://www.aaai.org/Papers/AIIDE/2008/AIIDE08-006.pdf