Open AccessAn Scrutiny of Run-time Ramification for 5-Proviso Busy Beaver Proving Empirical Composition
Publication year - 2019
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.i1117.0789s19
Subject(s) - beaver , scrutiny , function (biology) , computer science , ramification , algorithm , mathematics , combinatorics , ecology , evolutionary biology , political science , law , biology
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.