Abstract
The major aim of this paper is to undertake an experimental investigation for analyze the fluctuation between the descriptional (program-size) and computational time complexity. The investigation proceeds by systematic and exhaustive study for analysis of run-time complexity for 5-state Busy Beaver function using an experimental setup. To carry out experiment, TM simulator for Busy Beaver function will be tested for different N-values on different machines with different configurations and different platforms to calculate the run-time complexity. This study revealed that whether the Busy Beaver function is machine dependent. It also report that the average run-time of Busy Beaver function surely increases as the number of states.
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 callMore From: International Journal of Innovative Technology and Exploring Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
