Psystems, introduced by Gh. Pǎun form a new class of distributed computing model. Several variants of Psystems were already shown to be computationally universal. In this paper, we propose a new variant of Psystems, P systems with membrane creation, in which some objects are productive and create membranes. This new variant of Psystems is capable of solving the Hamiltonian Path Problem in linear time. We show that Psystems with membrane creation are computationally complete. © Springer-Verlag Berlin Heidelberg 2001.