As a way to explore certain aspects related the construction of motherhood, and by extension an ideal femininity in ancient Mesopotamia, this article we examine first millennium BCE baby incantation known us thanks two duplicates found city Assur. More specifically, concentrate on references mother text. In one herself cries when she sees that cannot stop her baby’s crying. second is presented ...

In this chapter we study the feasibility of using Turing Machines as a model for the evolution of computer programs. To assess this idea we select, as test problem, the Busy Beaver — a well-known theoretical problem of undisputed interest and difficulty proposed by Tibor Rado in 1962. We focus our research on representational issues and on the development of specific genetic operators, proposin...

Many programmers belive that Turing-based machines cannot think. We also believe in this, however it is interesting to note that the most sophisticated machines are not programmed by human beings. We have only discovered them. In this paper, using well-known Busy Beaver and Placid Platypus machines, we generate further very similar, but not exactly the same machines. We have found a recombinate...

The Busy Beaver is an interesting theoretical problem proposed by Tibor Rado in 1962. Since then, it has attracted the attention of many researchers and several contests were organised trying to produce good solutions. In this paper, we propose an evolutionary approach to the problem. Our experimental results prove that this technique is very effective in attacking Busy Beaver, since we were ab...

In this paper, we study the transient behavior of a state dependent M/M/1/K queue during the busy period. We derive in closed-form the joint transform of the length of the busy period, the number of customers served during the busy period, and the number of losses during the busy period. For two special cases called the threshold policy and the static policy we determine simple expressions for ...