نتایج جستجو برای: utm
تعداد نتایج: 761 فیلتر نتایج به سال:
1. Overview This paper talk about that NP is not AL and P, P is not NC, NC is not NL, and NL is not L. The point about this paper is the depend relation of the problem that need other problem's result to compute it. I show the structure of depend relation that could divide each complexity classes. 2. The condition to emulate the TM by using UTM We will begin by considering the important nature ...
Internet security problems remain a major challenge with many security concerns such as Internet worms, spam, and phishing attacks. Botnets, well-organized distributed network attacks, consist of a large number of bots that generate huge volumes of spam or launch Distributed Denial of Service (DDoS) attacks on victim hosts. New emerging botnet attacks degrade the status of Internet security fur...
1. Overview This paper talk about that NP is not AL=P by using circular founded set. I make set structure of CHAOS and computation history of Turing Machine. CHAOS is circular founded set and computation history of Turing Machine is well founded set. And Log space ATM can not compute CHAOS. 2. Computational problem as set In this paper, we think computational problem as set of related problems ...
In this paper we show that the probability that a program p of n bits halts at discrete time t (with t > 2n+1 − 2; we define the discrete time t as the integer number of steps done by an Universal Turing Machine during the execution of p, until the halt) tends to zero as the inverse law ∝ 1/t. This means that the greater is the time an n-bit program is running on an Universal Turing Machine (pr...
Non-self-similar sets defined by a decision procedure are numerically investigated by introducing the notion of inaccessibility to (ideal) decision procedure, that is connected with undecidability. A halting set of a universal Turing machine (UTM), the Mandelbrot set and a riddled basin are mainly investigated as non-self-similar sets with a decision procedure. By encoding a symbol sequence to ...
BACKGROUND Hemorrhage is the leading cause of preventable posttraumatic death. Many such deaths may be potentially salvageable with remote damage-control surgical interventions. As recent innovations in information technology enable remote specialist support to point-of-care providers, advanced interventions, such as remote damage-control surgery, may be possible in remote settings. METHODS A...
This theoretical note describes a simple equation that closely approximates the psychometric functions of template-matching observers with arbitrary levels of position and orientation uncertainty. We show that the approximation is accurate for detection of targets in white noise, 1/f noise, and natural backgrounds. In its simplest form, this equation, which we call the uncertain normal integral...
A new computing model, called the active element machine (AEM), is presented that demonstrates Turing incomputable computation using quantum random input. The AEM deterministically executes a universal Turing machine (UTM) program η with random active element firing patterns. These firing patterns are Turing incomputable when the AEM executes a UTM having an unbounded number of computable steps...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید