Questions tagged [non-deterministic]

Nondeterminism refers either to a computing system where the result may be one of many specified results or to a theoretical construct in which a computing system is allowed to try many options in parallel to search for a result.

Nondeterminism has several meanings in computing. In theoretical CS, nondeterministic computations are computations that have multiple options specified at various points and allows the computing machine to choose any of them. In programming, a nondeterministic computation is one where the result may vary from run to run due to factors such as thread timing or values from external devices.

238 questions
0
votes
1 answer

Nondeterministic Finite Automata construction

It feels like this should be easier than it is, but I am having an issue with it. Here is what is asked: Construct a NFA for the following language L = {ab,ba}*. So, I understand that I can have any combination of ab or ba in the string, but do I…
Nick
  • 25
  • 8
0
votes
0 answers

What are the sources of non-determinism in Tensorflow parallel computing?

To achieve deterministic results in Keras / Tensorflow, it is (among other things) necessary to "deactivate parallelism", as stated in the Keras doc: # Force TensorFlow to use single thread. # Multiple threads are a potential source of #…
Phylliade
  • 1,667
  • 4
  • 19
  • 27
0
votes
1 answer

Why are my unit tests using Moq's Verify() non-deterministic?

We are using Moq 4 for our unit tests, specifically controller unit tests. We are using Moq's Verify() method to make sure an error was logged. The problem is the tests can pass but then fail the very next run. We are using Serilog for our…
0
votes
1 answer

Indeterministic sets in Python 2 and 3

Python 2 Sets are collections of unordered values. If I construct a set via a set literal, e.g. s = {'a', 'b', 'c'} and then print it, I get the elements in some scrambled order. However, it seems that in Python 2.7, the above example always…
jmd_dk
  • 12,125
  • 9
  • 63
  • 94
0
votes
1 answer

Can every DFA be simulated by a PDA?

Given a Deterministic Finite Automata (DFA) M_1, does there always exist a Pushdown Automata (PDA) M_2 that accepts the same language as M_1? I.e. can any DFA be simulated by a PDA? Intuitively, it makes sense to me that a PDA is more powerful…
0
votes
1 answer

Alternative SqlDependency for non-deterministic functions?

I need to use a getdate() function on SqlDependency but that is part of its limitations. (non-deterministic function) What alternative do I have for it?
Jamo
  • 494
  • 5
  • 24
0
votes
1 answer

Comparing non-deterministic and also the deterministic expressive power of FA, PDA's and TM'S

I am sorta confused and also could not find a answer online, but in terms of expressive power, . Non-deterministic FA, PDA, TM NFA < NPDA < NTM Deterministic FA,PDA,TM: This is where i am confused DFA < PDA < TM? In a whole: ? DFA = NFA = e-NFA =…
0
votes
1 answer

Simulating Non Deterministic Turing machine with Deterministic Turing machine [JFLAP]

Problem: Given a start state q0, and a completely blank tape except for one square with a # symbol, find the # and halt on it. Non-Deterministically: This machine chooses to either search left or right of the start state, and keeps going in that…
0
votes
2 answers

Ensure that c# Assemby are deterministic

It is possible to restrict specific classes, such as Random or DateTime, or the use of float in an AppDomain. Is it possible to detect it by reflection if you use them? or should we look at the IL code? I would like to make a plugin system, but I…
0
votes
0 answers

Retrieve application name parameter without APP_NAME() due it's a non-deterministic function

Is it possible to retrieve the application name connection parameter without using APP_NAME() because I've to use in a view sql and I can't create an index due APP_Name() it's a non-deterministic function
0
votes
1 answer

Is epsilon and empty set languages of NFA? (Nondeterministic Finite Automata)

I have a NFA like this: and the question is: Are epsilon and empty set languages of this NFA?
Lucas
  • 329
  • 1
  • 13
0
votes
0 answers

Does a non deterministic turing machine solves a non deterministic algorithm in polynomial time

Can a non deterministic turing machine solve a non deterministic algorithm in polynomial time with good guessing. And if yes why or how? Also if not why not?
Vedad
  • 223
  • 4
  • 15
0
votes
1 answer

Nondeterministic Pushdown Automata different diagrams

In introduction to the theory of computation book, for the language a state diagram is given as : I know there could be alternative diagrams but I doubt the solution I found might be wrong which is slightly different than the original one: I…
0
votes
1 answer

Convert to a deterministic function with SQL Server

I am trying to create a deterministic function with SQL Server so that I can create an index for a view, which calls this function. This function takes a column name and returns the end of the month as datetime. For example, 201701 to 20170131. Can…
E.K.
  • 4,179
  • 8
  • 30
  • 50
0
votes
1 answer

Quantification of non-determinism in CS experiments

Heyall, I'm working on my MSc thesis in computer science. More specifically, I am doing research on the effects of tuning the hyperparameters of distributional semantic models when used as features in statistical dependency parsers. I am using…