Questions tagged [computation]

Computation is paramount to the discipline of computer science, and deals with the type and use of computing technology in information processing, in particular, in the context of an algorithm, or a protocol.

From Wiki

In the theory of computation, a diversity of mathematical models of computers have been developed. Typical mathematical models of computers are the following:

  • State models including Turing machine, push-down automaton, finite state automaton, and PRAM
  • Functional models including lambda calculus
  • Logical models including logic programming
  • Concurrent models including actor model and process calculi
404 questions
0
votes
1 answer

ways for speed up MATLAB application

i have a question on speed up application built by MATLAB software, i need to know the affect of using vectorization and parallel computation on speed up the application ? and if there is better method than both previous way in such case ? thanks
0
votes
1 answer

Confusing Language for a Deterministic Finite State Machine

I am supposed to show a DFSM to accept the following language for my theory of computation class, but that isn't what I am having trouble with. I'm not even sure what the language means. Can someone explain what this means in English? If I…
Bryan
  • 2,951
  • 11
  • 59
  • 101
0
votes
1 answer

Why isn't the class of Turing-Recognizable languages closed under Complement?

I'm studying Turing Machines and I've already showed how Turing-Decidable is closed for the operations of Union, Intersection, Concatenation, Complement and Kleene Star. Next I did some demonstrations to show how T-Recognizable languages are closed…
Sasha Fonseca
  • 2,257
  • 23
  • 41
0
votes
4 answers

How does an environment (e.g. Ruby) handle massive integers?

My integers in Ruby (MRI) refuse to overflow. I've noticed the class change from fixnum to bignum but I'm wondering how this is modeled and what sort of process ruby uses to perform arithmetic on these massive integers. I've seen this behaviour in…
deau
  • 1,193
  • 1
  • 9
  • 14
0
votes
1 answer

explaining context free grammar ambiguity for job interview

I was at a job interview, and this is the question they asked me, Are these two below ambigous? If they are, provide a string. If they are not, prove why they are not. I couldn't solve it, and would like to know the answer and the reason for the…
NoNameY0
  • 612
  • 2
  • 8
  • 18
0
votes
1 answer

Database suggestion (and possible readings) for heavy computational website

I'm building a website that will rely on heavy computations to make guess and suggestion on objects of objects (considering the user preferences and those of users with similar profiles). Right now I'm using MongoDB for my projects, but I suppose…
Sovos
  • 3,330
  • 7
  • 25
  • 36
0
votes
1 answer

Context-free language not closed under intersection

I found this solution on Wikipedia. Shouldn't it say: j>n≥ 0 Because the intersection are elements that are common in both languages. Consider the languages L1 and L2 defined by L1={a^(n)b^(n)c^(j)| n,j ≥ 0} and L2 = {a^(j)b^(n)c^(n): n,j ≥ 0}.…
Jonathan Lam
  • 185
  • 2
  • 3
  • 12
0
votes
1 answer

Constructing Regular expression that generates a given languge

This is an example ginen in my textbook "Introduction to theory of Computation". Given that the alphabet ∑ as{0,1}, {w|every 0 in w is followed by atleast one 1}} a regular expression for it is shown as (01+)*. 1+ means only a single instance of…
Haya Hallian
  • 153
  • 2
  • 11
0
votes
2 answers

Android emulator accuracy and predicting time of operation

How accurate is the Android emulator in terms of how an app will function on a physical Android device? I am an amateur developer for Android but due to circumstances, do not own an Android device myself. Is how long the app takes to load/function…
user1246462
  • 1,228
  • 3
  • 11
  • 20
0
votes
2 answers

Java exception invalid int for long integer

I'm currently developing a math application that makes long computations. I'm getting java.lang.NumberFormatException: Invalid int: "..." error (where the ... is replaced by a very long number) whenever I type an integer that contains more than 9…
user1246462
  • 1,228
  • 3
  • 11
  • 20
0
votes
0 answers

Compiler programming languages theory, computer usable computing and I/O parts

I started with a small theory of cmd and extensions. First of all was that it consists of compilation to object file, linkage and compilation to exe. The languages mainly consist of operators, keywords and directives which is compiled into machine…
lopidas
  • 13
  • 6
0
votes
3 answers

Is this simulation appropriate for CUDA or OpenCL?

I'm asking on behalf of a friend working in numerical astrophysics. Basically what he's doing is simulating a cloud of gas. There are a finite number of cells and the timestep is defined such that gas cannot cross more than one cell each step. Each…
user478250
  • 259
  • 2
  • 9
0
votes
3 answers

Can i count the number of digits in a string with FSM?

I want to count the number of digits in a string which can include non digits(aa11aa1a). Can i solve this problem with a Finite State Machine? Can this problem be represented as regular expression? What if i want to know whether the count is "X" or…
mert inan
  • 1,537
  • 2
  • 15
  • 26
0
votes
1 answer

what is max size of string i can support in my string permutations algo if i have 1GB memory

for below mentioned string permutation algo or any other recursive algo, what is max size of string supported if i have 1 GB of dedicated memory available. public void permutate(String prefix, String word){ if(word.length() <= 1){ …
banjara
  • 3,800
  • 3
  • 38
  • 61
0
votes
1 answer

Theory of Computation: Design a 2-stack PDA for this language?

Consider a language L2 = { ak bk ck | k >= 0 }. (k should be superscript) Design a 2-stack PDA for the language L2. Could anyone give me some guidance on how to go about doing this?