Finite computing agents that interact with an environment are shown to be more expressive than Turing machines according to a notion of expressiveness that measures problem-solving ability and is specified by observation equivalence. Sequential interactive models of objects, agents, and embedded systems are shown to be more expressive than algorithms. Multi-agent (distributed) models of coordin...

0

Automated planning has become an increasingly influential area of research in the realm of artificial intelligence. Task based planning algorithms provide a number of advantages including the ease of human readability when creating mission length plans. However, task based planning algorithms are rarely implement on real world robotic systems because they require additional domain specific know...

it is shown that every  almost linear bijection $h : arightarrow b$ of a unital $c^*$-algebra $a$ onto a unital$c^*$-algebra $b$ is a $c^*$-algebra isomorphism when $h(3^n u y) = h(3^n u) h(y)$ for allunitaries  $u in a$, all $y in a$, and all $nin mathbb z$, andthat almost linear continuous bijection $h : a rightarrow b$ of aunital $c^*$-algebra $a$ of real rank zero onto a unital$c^*$-algebra...

Carbon nanotube field effect transistors (CNFETs) are being extensively studied as possible successors to Silicon MOSFETs. Implementable CNTFET circuits have operational characteristics to approach the advantage of using MVL in voltage mode. In this paper we used CNTFETs to implement the improved Gödel basic operators. This paper presents arithmetic operations, implication and multiplication in...