teoria-da-computação

Seeing this question I have a doubt, coming from PHP and in the past having" problems " derived from character encoding, ex ... n"; // 1 cout << sizeof(a) << "\n"; // 1 cout << sizeof('ã') << "\n"; // 4 } Where are we?

Until the time when computers were purely mechanical and were programmed by punched cards I understand how it works. Then, ... t of an assembly is another file in text format with 0's and 1's only? Or are electrical impulses sent to the valved machine.

Studying about complexity, I came across the term NPI. It means NP-intermediate. But I did not understand what this "intermed ... er ): NP : non-deterministic polynomial P : polynomial deterministic NPC : NP-Complete NPI : NP-Intermediate

In Wikipedia has the following statement : In formal language theory, a context-free language (LLC) it is a language g ... at is a context-free language? How is it possible, if it is possible, to define whether a language is context-free or not?

When talking about concurrent programming, they always cite 3 Classic problems / concurrency Models: producers and consum ... ? is there something real and everyday that we run into this problem without having knowledge? I don't know, in a database?

What is this one Máquina de Turing that made Turing be recognized as "Pai da Computação"? How does it work and how does it read a binary tape?

I have read and re-read in Wikipedia , I have watched some 15 videos in English and Portuguese on this subject, I have read s ... ing the contradiction do not make sense in my head. Please without technical terms. Help me with simple logic to understand.

Reading a few things about architecture, in several cases Harvard architecture is compared with Von Neumann architecture. I f ... Harvard. What is Harvard architecture about? How does it work? What advantages does it have over Von Neumann's architecture?

How does it work and why did it become the dominant computational model?

Is there a difference in computational power between a deterministic and a non-deterministic stack automaton?

I recently saw a publication of how Perl was taught to recognize a prime number using regular expressions. The regular expre ... f a number is prime? If so, how is he? If not, what is the proof that this problem cannot be solved through regular language?

What is the complexity of an algorithm? And what are the ways to measure it? (Big O, Big Theta...)

Some conditions can prevent the progress of execution of processes or threads, two of these conditions are called dead-lock a ... . How does this work? in what scenario is this useful? or can it even get in the way? Can you give any examples of this?

Reading a question about basic programming concepts, I come across the following statement: Let A and B be two languages ... irregular language? In the above statement Why is only language B regular? What are the main examples of the two languages?

The stop problem can be explained as: given a program and an input to it, will it complete its execution and return a respons ... ow how many digits that has. My question is: what is wrong? Clearly the problem is undecidable. Where does this method fail?

How to determine which of these two functions is the best choice for implementation? 1: int X(int x){ if(x<=0) retu ... =x;++i) soma+=i; return soma; } How to determine the complexity equations and solve them? Or is there another method?

Regarding the 4 types of languages, I have doubt in understanding about the context-dependent or context-sensitive language. ... by the sites, I would like someone to help me understand what is a context-sensitive language and a unrestricted language.

closed . This question needs details or to be clearer and is not currently accepting answers. ... s he responsible for leaving the screens functional and dynamic ? or is he simply responsible for doing just the look (ux)?