Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 7 years ago.
Improve this question
I would like to know what is the most tiny programming language in aspects of commands i.e, which includes the least number of commands.
Is it brainf***k?
Subtract and Branch if Negative (SBN) is a single instruction computer. And it is Turing complete, which means any computer program can be solved using just above instruction.
Such computer is called One Instruction Set Computer. There are several possible single instruction that can be used, some of which are:
Subtract and branch if less than or equal to zero
Subtract and branch if negative
Reverse subtract and skip if borrow
Subtract and branch if non zero
Related
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 6 years ago.
Improve this question
I need to compare two input strings and display the number of common characters in Assembly but i can't find how to do that.
To do it efficiently you would need some sort of data structure to remember which characters you have seen already.
If you don’t mind duplicates and don't need efficiency, you could loop over the first string and, for each character, loop over the second string and compare them (adding one to a register or a variable when they match).
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 6 years ago.
Improve this question
Which features need to be present in a programming language such that it can express any sequential computation which a computer can excute today? And what if the language is Haskell in specific
Haskell is Turing complete.
My current beliefs have high weight on the outcome that any sound and complete description of "feature sets that guarantee Turing completeness" is either infinite or includes a non-terminating algorithm; so I believe it is not reasonable to expect an answer to your other question.
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 8 years ago.
Improve this question
In 1/0 Knapsack Problem, one can implement it dynamically with two for loops, like
on this site: http://www.bogotobogo.com/Algorithms/knapsack.php
How can i implement it with a priority queue and optimize it with multithreading?
In the algorithm in the section "0-1 Knapsack - Dynamic Programming", the inner loop can be parallelized. The execution of the loop's body for different values of jw can be executed in parallel as the calculation of the value for m[i][jw] does not require values m[i][jw'] where jw'!=jw, i.e. any iteration does not depend on previous iterations.
Closed. This question needs details or clarity. It is not currently accepting answers.
Want to improve this question? Add details and clarify the problem by editing this post.
Closed 9 years ago.
Improve this question
Does the current Linux kernels implements some form of page coloring when assigning virtual to physical address mapping?
Arka
No.
Linus said:
there have been at least four different major cache coloring trials
for the kernel over the years. This discussion has been going on since the
early nineties. And none of them have worked well in practice.
Reasons are that it adds too much cost to the page free/page alloc paths, and it's pointless
because caches have become associative so that there is no need.
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 4 years ago.
Improve this question
What are the effects of multiplication of two different sound? An neither of them are constant, like two different songs, or one track of instrumental and one of vocals.
A simple Google search came up with this:
http://crca.ucsd.edu/~msp/techniques/v0.11/book-html/node77.html
Did you search for it at all?
But basically what happens is you end up creating an envelope where the second acts as a "coefficient" of sorts.
You also end up with a reduction of sound levels (since a decimal times a decimal is less both of them), so you'll need to amplify the signal a bit to retain volume.
The page I linked gives a lot more explanation and has a lot of the algebra needed to write up a code to implement it. Look there if you have any more questions.