Is there any difference between the terms "sum" and "coproduct" in type theory? Computer Science |
- Is there any difference between the terms "sum" and "coproduct" in type theory?
- Parallelizing recursive octree dual algorithm with OpenCL
- Is there such a thing as the "friend test", and if so, how close are chatbots to passing it? Unlike the Turing test, the friend test would measure whether a chatbot can be your friend and make you less lonely.
- Book recommendations for Game Complexity (complexity of forced wins in games/puzzles)
- Quick question about database results
- Python for Everyone
| Is there any difference between the terms "sum" and "coproduct" in type theory? Posted: 01 Nov 2018 04:32 AM PDT I've been powering through some type and category theory work to finally break through the wall of really understanding free monads and a blocker was understanding how to combine algebras using coproducts. It only finally clicked when I read that a coproduct is essentially just a sum. Is there any way in which it isn't? [link] [comments]  |
| Parallelizing recursive octree dual algorithm with OpenCL Posted: 31 Oct 2018 09:35 PM PDT I'm currently experimenting with some isosurface generation techniques. I have successfully implemented Adaptive Dual Contouring of Hermite Data by Ju et al. Link to paper In pursuit of performing complex Boolean (CSG) operations, in real-time, I am trying to implement the isocontouring technique in OpenCL. Tree generation, calculation of signed distance function, and minimizing the quadratic error function to place minimizing vertex within cell all seems to be straightforward. The last part of the algorithm connects vertices which are dual to the octree cells which share a common minimum edge. There are 3 functions described in the paper: procCell - spawns 8 procCell, 12 procFace, 6 procEdge procFace - calls 4 procFace, 4 procEdge procEdge - calls 2 procEdge These recursive functions uniquely arrive at the minimum edges of the octree leaf nodes, allowing one to connect the dual vertices, with quads and triangles. I've been struggling to figure out how to implement this in OpenCL. Any suggestions would be enormously helpful. This seems like a parallel graph transversal problem, so perhaps the producer-consumer model would be of help. [link] [comments]  |
| Posted: 31 Oct 2018 05:43 AM PDT Lonely people would know these are just chatbots, but they might be good enough to make them less lonely. [link] [comments]  |
| Book recommendations for Game Complexity (complexity of forced wins in games/puzzles) Posted: 01 Nov 2018 04:16 AM PDT Hi, thanks in advance for the attention. I'm reading "Games, Puzzles and Computation" by Erik Demain, which introduces a very cool mathematical instrument called "constraint logic" to prove the hardness/completeness of various types of games. While reading it I understood that there already was "classic" literature about Game Complexity before constraint logic. Since I am reading about this to prepare for my Bachelor's thesis in Computer Science, I would like to know as much as possible about this subject. What book(s) would you recommend? [link] [comments]  |
| Quick question about database results Posted: 31 Oct 2018 05:52 PM PDT How database results are read into memory is determined by: A the program B the database driver C the operating system D none of the above [link] [comments]  |
| Posted: 31 Oct 2018 05:03 AM PDT |
| 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