Problem Detail: I’m still fairly new to Turing Machines, but I’ve been doing some research. I know that a Turing Machine can have an infinite tape and that it requires a finite number of states, but does it necessarily follow that Read More …
Author: ignougroup
[Solved]: Find hamilton cycle in a directed graph reduced to sat problem
Problem Detail: I need to find a Hamiltonian cycle in a directed graph using propositional logic, and to solve it by sat solver. So after I couldn’t find a working solution, I found a paper that describes how to construct a Read More …
[Solved]: How can I sum pixel values over a rotated rectangle?
Problem Detail: I have an optimization problem in which I need to sum pixel values in an image over a rectangular region. This is a core component of the optimization so it will be done often and the naive solution is Read More …
[Solved]: Why does a MP3 encoder use a fast Fourier transform before applying the psychoacoustic model?
Problem Detail: Karlheinz Brandenburg depicts a MP3 encoder like this: Source: MP3 and AAC Explained I marked the FFT as I’m not quite sure why it is actually necessary to perform one. Why can’t the psychoacoustic model be applyed to the Read More …
[Solved]: What does it mean to be Turing reducible?
Problem Detail: I’m confused about what it means to be Turing reducible. I thought I understood what it meant, but apparently not. $A leq B $ Means that A is Turing reducible to B. This means that given an oracle for Read More …
[Solved]: How to Convert a Directed Graph to an Undirected Graph (Adjacency Matrix)
Problem Detail: Given an adjacency matrix, what is an algorithm/pseudo-code to convert a directed graph to an undirected graph without adding additional vertices (does not have to be reversable)? similar question here Asked By : Ibrahim Answered By : Irvin Lim Note that Read More …
[Solved]: How to calculate or estimate how long it takes to solve a recurrence relation?
Problem Detail: I am trying to understand how to solve complex recurrence relations and whether there is a general method or technique to help me. That being said I am not talking about recurrence relations that can be solved using the Read More …
[Solved]: Is this language regular?
Problem Detail: Consider the following language: $$ L_1={uu^rv mid u,vin{0,1}^+}.$$ that means that neither $u$ nor $v$ can be $varepsilon$. As usual $u^r$ refers to $u$ reflected. I think that this language is not regular, but i am not sure. Any Read More …
[Solved]: Is this graph a hamiltonian graph?
Problem Detail: I (will, at the end) have a connected, undirected graph with N nodes and 2N-3 edges. You can consider the graph as it is built onto an existing initial graph , which has 3 nodes and 3 edges, iteratively. Read More …
[Solved]: About the behaviour of multi-layer perceptrons
Problem Detail: I have a multilayer perceptron. It has an input layer with two neurons, a hidden layer with an arbitrary number of neurons, and an output layer with two neurons. Given that randomboolean and targetboolean are random boolean values, and Read More …
