Abstract: The complexity of computational models can also put up some emergence properties around several certain critical values. I}his paper surveyed some computational emergence behaviors, and built their Constrained Generating Procedure(CGP) model. We introduced the CGP mechanic participating times, participating depth and average participaling degree, and then analyzed the critical values of emergence properties on 3 typical Turing machine computation processes.

Key words: Computational emergence, Constrained generating procedure, Turing machine, Computing complexity