An Scrutiny of Run-time Ramification for 5-Proviso Busy Beaver Proving Empirical Composition
-
Published:2019-08-23
Issue:9S
Volume:8
Page:726-732
-
ISSN:2278-3075
-
Container-title:International Journal of Innovative Technology and Exploring Engineering
-
language:en
-
Short-container-title:IJITEE
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.
Publisher
Blue Eyes Intelligence Engineering and Sciences Engineering and Sciences Publication - BEIESP
Subject
Electrical and Electronic Engineering,Mechanics of Materials,Civil and Structural Engineering,General Computer Science
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Load Optimization Accessions, Ramification the QoS in Software Defined Networking;2023 International Conference on Artificial Intelligence and Smart Communication (AISC);2023-01-27
2. Attacks Opportunities in the Cyber Physical Space and the Role of Cybersecurity;2021 2nd International Conference on Computational Methods in Science & Technology (ICCMST);2021-12