Problem Detail: I just read some pages in Sipser’s book Introduction to Theory of Computation about Post Correspondence Problem, and I’m thinking that PCP is actually in NP. The certifier is: for an input configuration of pile $$(t_1/b_1, t_2/b_2,…t_n/b_n)$$ concatenating $t_1, Read More …
Category: Uncategorized
[Solved]: How to use Artificial Intelligence in Computer Chess
Problem Detail: In some (historical) papers, chess has been referred to as the drosophila of artificial intelligence. While I suppose that in current research, the mere application of a search algorithm is at best advanced computer science, I believe that there Read More …
[Solved]: 0/1 Integer Programming and Karp’s Reduction
Problem Detail: I have been reading Karp’s famous paper on the NP-Completeness of different problems, Reducibility among combinatorial problems, and I have a question on the reduction from SAT to 0/1 Integer Programming defined there. The problem 0/1 Integer Programming is Read More …
[Solved]: What is a partially sorted array?
Problem Detail: I come across this definition but it’s not so clear for me ! An array is partially sorted if the number of inversions is less or equal a constant times the array length. if array length is N then Read More …
[Solved]: What is required for universal analogue computation?
Problem Detail: What operations need to be performed in order to do any arbitrary analogue computation? Would addition, subtraction, multiplication and division be sufficient? Also, does anyone know exactly what problems are tractable using analogue computation, but not with digital? Asked Read More …
[Solved]: How Do Common Pathfinding Algorithms Compare To Human Process
Problem Detail: This might border on computational cognitive science, but I am curious as to how the process followed by common pathfinding algorithms (such as A*) compares to the process humans use in different pathfinding situations (given the same information). Are Read More …
[Solved]: Is interaction more powerful than algorithms?
Problem Detail: I’ve heard the motto interaction is more powerful than algorithms from Peter Wegner. The basis of the idea is that a (classical) Turing Machine cannot handle interaction, that is, communication (input/output) with the outside world/environment. How can this be Read More …
[Solved]: Constructing a data structure for a computer algebra system
Problem Detail: In thinking about how to approach this problem I think several things will be required, some tivial: An expression tree where non-leaf node is an operation (not sure if that part is redundant), but not every node has just Read More …
[Solved]: Is it possible for a language and its complement to both be unrecognizable?
Problem Detail: Given some unrecognizable language $L$, is it possible for its complement $overline{L}$ to also be unrecognizable? If some other language $S$ and its complement $overline{S}$ are both recognizable, then $S$ and $overline{S}$ are decidable. If $overline{S}$ is unrecognizable, then Read More …
[Solved]: Is there a shell between the kernel and hardware
Problem Detail: First and foremost, i know what a shell, kernel is. Now the dilemma. Today i had my systems viva in college. The examiner asked me is there a shell between the hardware and the kernel. Obviously, i said no, Read More …
