OS Concepts from a theoretical perspective Computer Science |
- OS Concepts from a theoretical perspective
- Discrete math: where do the truth values for p, q, and r come from?
- Imagine a made for computers derivative of roman numerals. Might have some advantages for some rare niche use
- Request-Review for LOGSPACE vs P paper
- Advice about making a game with a game engine, considering I already know the relevant programming languages.
- My paper just got rejected
- Got a HCI exam in 3 days
| OS Concepts from a theoretical perspective Posted: 05 Jan 2019 08:54 AM PST OS concepts are inherently technical, as is reflected in some of the most popular books in this space- e.g. OS in three easy pieces, etc. Is there a book that treats OS concepts from a more theoretical CS, or mathematical background? [link] [comments]  |
| Discrete math: where do the truth values for p, q, and r come from? Posted: 05 Jan 2019 09:08 PM PST My book never went over this but I wondered where the values for p (T, T, F, F) and other variables come from. My book also never discussed what determines the number of rows in a truth table (although I did find out later on YouTube). Also not sure why in this table the last column isn't all just F. When using and (^), don't both statements in parentheses have to be true for the entire statement to be true? [link] [comments]  |
| Posted: 05 Jan 2019 08:14 PM PST Firstly, it needs the concept of zero. Secondly, the symbols are round numbers in base 2. Numbers consist of symbols stringed. This also resembles how coins form a sum or how numbers are vocalized. Symbol for a larger number means 2 or 4 times bigger number than previous number: symbols for: 1,2, 4, 8, 16... 1024 ... 232. Then a subtraction section so that number in that is subtracted from the main number. In roman, XVI = 16 and IX=9. This system could have ( 256+2+1 ) - ( 32+8+0+0 ) = 219. Symbols can be in arbitrary order and there can be any number of zeros. If first number is zero and subtracted number is not, there is a negative number. Some calculations are symbol matching and simpler. Advantage may require a special CPU chip, not just software. Physical soft errors affect calculations differently, so one advantage may relate to radiation hardening of computers. Maybe this leads to some better idea... Representations of numbers can be strange and numerous. [link] [comments]  |
| Request-Review for LOGSPACE vs P paper Posted: 05 Jan 2019 07:58 PM PST P versus NP is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? A precise statement of the P versus NP problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed. Given a positive integer x and a collection S of positive integers, MAXIMUM is the problem of deciding whether x is the maximum of S. We prove this problem is complete for P. Another major complexity classes are LOGSPACE, NLOGSPACE, coNP and EXP. Whether LOGSPACE = NLOGSPACE is a fundamental question that it is as important as it is unresolved. We show the problem MAXIMUM can be decided in logarithmic space. Consequently, we demonstrate the complexity class LOGSPACE is equal to P and thus, LOGSPACE is equal to NLOGSPACE. Furthermore, we define a problem called SUCCINCT-MAXIMUM. SUCCINCT-MAXIMUM contains the instances of MAXIMUM that can be represented by an exponentially more succinct way. We show this succinct version of MAXIMUM is in coNP. Since SUCCINCT-MAXIMUM is a succinct version of a P-complete problem, then this might be a good candidate to be in EXP-complete and therefore, this would imply the complexity class P is not equal to NP. [link] [comments]  |
| Posted: 05 Jan 2019 09:11 AM PST Hi! So I really wanna make a game of my own, and assuming I know C# for Unity or C++ for Unreal Engine, what would you recommend I do to actually learn how to use the code in the engine? I've tried a few basic tutorials and stuff, but nothing really sticks. Thanks [link] [comments]  |
| Posted: 05 Jan 2019 11:21 AM PST I wrote a paper on heuristic search back in October and submitted it to JAIR. This week, I finally got a rejection letter. Apparently the "scope is to narrow," but they did recommend me to submit my article for the SoCS conference. Seems like I now officially work on something so specialised that nobody understands or cares about what I am doing. [link] [comments]  |
| Posted: 05 Jan 2019 09:36 PM PST Haven't done any revision or been to any of the lectures? Where to start? [link] [comments]  |
| You are subscribed to email updates from Computer Science: Theory and Application. To stop receiving these emails, you may unsubscribe now. | Email delivery powered by Google |
| Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States | |
No comments:
Post a Comment