Abstract
In this paper we investigate the minimal-program complexity of several types of pseudo-recursive and pseudo-random sequences when the resources used for their computation are restricted. For several types of these sequences their minimal-program complexity increases enormously whenever the resources for their computation is restricted in any effective manner at all. In particular, it is shown that Church random sequences must have very high minimal-program complexity when the computation resources are effectively restricted; whereas, it is known that when there are no restrictions on resources, there are Church random sequences with extremely low minimal-program complexity.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
