An Scrutiny of Run-time Ramification for 5-Proviso Busy Beaver Proving Empirical Composition
Pardeep Singh Tiwana1, Harjot Singh Tiwana2, Rajeev Sharma3, Astha Gupta4

1Pardeep Singh, Department of IT, Chandigarh Engineering College, Landran (Punjab), India.

2Harjot Singh, Department of CSE, Chandigarh Engineering College, Landran (Punjab), India.

3Rajeev Sharma, Department of CSE, Chandigarh Engineering College, Landran (Punjab), India.

4Astha Gupta, Department of IT, Chandigarh Engineering College, Landran, India.

Manuscript received on 05 August 2019 | Revised Manuscript received on 12 August 2019 | Manuscript Published on 26 August 2019 | PP: 726-732 | Volume-8 Issue-9S August 2019 | Retrieval Number: I11170789S19/19©BEIESP | DOI: 10.35940/ijitee.I1117.0789S19

Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open-access article under the CC-BY-NC-ND license (

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.

Keywords: Busy Beaver Function, Computational Complexity, Program-Size Complexity.
Scope of the Article: Software Defined Networking and Network Function Virtualization