https://www.bibsonomy.org/tag/computationBibSonomy RSS Feed for /tag/computationIn this work, we present a universal whitening algorithm using n-qubit permutation matrices to remove the imperfections in commercial random number generators without compression. Specifically, we demonstrate the efficacy of our algorithm in several categories of random number generators and its comparison with cryptographic hash functions and block ciphers.https://wireilla.com/papers/ijcis/V14N2/14224ijcis01.pdfalinta2024-10-17T11:34:35+02:00& Biological Coding Computation Cryptography Evolutionary Quantum and cryptography <span itemprop="description">In this work, we present a universal whitening algorithm using n-qubit permutation matrices to remove the imperfections in commercial random number generators without compression. Specifically, we demonstrate the efficacy of our algorithm in several categories of random number generators and its comparison with cryptographic hash functions and block ciphers.</span>https://web.archive.org/web/20231016133443/https://phys.org/news/2023-10-cheapest-plane-ticket.htmlbshanks2023-10-20T09:13:58+02:00computation computer econ plane rational <a itemprop="url" data-versiondate="2023-10-20T09:13:58+02:00" href="https://web.archive.org/web/20231016133443/https://phys.org/news/2023-10-cheapest-plane-ticket.html" rel="nofollow" class="description-link">https://web.archive.org/web/20231016133443/https://phys.org/news/2023-10-cheapest-plane-ticket.html</a>https://twitter.com/SchillerJackie/status/1515189673756344321bshanks2022-06-11T23:21:27+02:00computation dendrite motor <a itemprop="url" data-versiondate="2022-06-11T23:21:27+02:00" href="https://twitter.com/SchillerJackie/status/1515189673756344321" rel="nofollow" class="description-link">https://twitter.com/SchillerJackie/status/1515189673756344321</a>https://www.science.org/doi/10.1126/science.abn1421#.YljtXxX6YoA.twitterbshanks2022-06-11T23:20:27+02:00computation dendrite intracellular intraneuronal <a itemprop="url" data-versiondate="2022-06-11T23:20:27+02:00" href="https://www.science.org/doi/10.1126/science.abn1421#.YljtXxX6YoA.twitter" rel="nofollow" class="description-link">https://www.science.org/doi/10.1126/science.abn1421#.YljtXxX6YoA.twitter</a>https://www.smbc-comics.com/comic/2013-11-14bshanks2020-07-09T04:32:31+02:00computation economics rational rationality smbc <a itemprop="url" data-versiondate="2020-07-09T04:32:31+02:00" href="https://www.smbc-comics.com/comic/2013-11-14" rel="nofollow" class="description-link">https://www.smbc-comics.com/comic/2013-11-14</a>Courses for Numerical Sampling and Inference at Dukehttp://people.duke.edu/~ccc14/kirk862020-06-16T22:37:52+02:00computation course inference lecture notes sampling website <span itemprop="description">Courses for Numerical Sampling and Inference at Duke</span>Computational Statistics in Python Coursehttps://people.duke.edu/~ccc14/sta-663/index.htmlkirk862020-06-16T22:30:53+02:00computation course lecture mcmc notes sampling website <span itemprop="description">Computational Statistics in Python Course</span>http://people.eecs.berkeley.edu/~tianshi/research.htmlbshanks2020-06-14T01:22:46+02:00computation phase turing universal <a itemprop="url" data-versiondate="2020-06-14T01:22:46+02:00" href="http://people.eecs.berkeley.edu/~tianshi/research.html" rel="nofollow" class="description-link">http://people.eecs.berkeley.edu/~tianshi/research.html</a>Courses into CS and Statshttps://people.eecs.berkeley.edu/~jordan/courses.htmlkirk862020-01-28T15:40:17+01:00complexity computation course lecture notes probability stats website <span itemprop="description">Courses into CS and Stats</span>Topics in Theoretical Computer Science: An Algorithmist's Toolkit 2007https://dspace.mit.edu/bitstream/handle/1721.1/55908/18-409Fall-2007/OcwWeb/Mathematics/18-409Fall-2007/Readings/index.htmkirk862020-01-15T02:48:41+01:00computation course lecture notes theory website <span itemprop="description">Topics in Theoretical Computer Science: An Algorithmist&#039;s Toolkit 2007</span>Topics in Theoretical Computer Sciencehttp://stellar.mit.edu/S/course/18/fa09/18.409/materials.htmlkirk862020-01-15T02:45:11+01:00computation course lecture notes theory website <span itemprop="description">Topics in Theoretical Computer Science</span>Advanced Theoretical Computer Sciencehttp://users.cms.caltech.edu/~vidick/teaching/kirk862020-01-14T16:24:15+01:00computation course lecture notes slides theory website <span itemprop="description">Advanced Theoretical Computer Science</span>Mathematics of CS MIT 6.042 Spring 2018https://courses.csail.mit.edu/6.042/spring18/kirk862020-01-07T03:26:52+01:00book computation mathematics notes website <span itemprop="description">Mathematics of CS MIT 6.042 Spring 2018</span>Building Blocks for Theoretical Computer Sciencehttp://mfleck.cs.illinois.edu/building-blocks/kirk862020-01-07T03:02:01+01:00book computation mathematics website <span itemprop="description">Building Blocks for Theoretical Computer Science</span>Algorithms by Jeff Ericksonhttp://jeffe.cs.illinois.edu/teaching/algorithms/kirk862020-01-07T02:59:34+01:00book computation theory website <span itemprop="description">Algorithms by Jeff Erickson</span>Luca Trevisan Lecture Notes on Theoretical CS, ML and Optimhttps://lucatrevisan.github.io/kirk862019-11-14T20:16:45+01:00complexity computation course lecture notes optimization probability stats theory website <span itemprop="description">Luca Trevisan Lecture Notes on Theoretical CS, ML and Optim</span>This page provides quick links to lecture notes that I have written for various classes: CS254: A graduate class on computational complexity (Stanford) [Spring 2010 Class Home Page] [Notes for Lectures 1-8] CS278: A graduate class on computational complexity (Berkeley) [Spring 2001 Class Home Page] [Fall 2002 Class Home Page] [2001 Lecture Notes in book…https://lucatrevisan.wordpress.com/lecture-notes/kirk862019-11-09T20:39:24+01:00complexity computation course lecture notes optimization theory website <span itemprop="description">This page provides quick links to lecture notes that I have written for various classes: CS254: A graduate class on computational complexity (Stanford) [Spring 2010 Class Home Page] [Notes for Lectures 1-8] CS278: A graduate class on computational complexity (Berkeley) [Spring 2001 Class Home Page] [Fall 2002 Class Home Page] [2001 Lecture Notes in book…</span>This subject offers an interactive introduction to discrete mathematics oriented toward computer science and engineering. The subject coverage divides roughly into thirds: Fundamental concepts of mathematics: Definitions, proofs, sets, functions, relations. Discrete structures: graphs, state machines, modular arithmetic, counting. Discrete probability theory. On completion of 6.042J, students will be able to explain and apply the basic methods of discrete (noncontinuous) mathematics in computer science. They will be able to use these methods in subsequent courses in the design and analysis of algorithms, computability theory, software engineering, and computer systems.Interactive site components can be found on the Unit pages in the left-hand navigational bar, starting with Unit 1: Proofs.https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-042j-mathematics-for-computer-science-spring-2015/kirk862019-11-08T18:31:34+01:00book computation course mathematics proof-systems website <span itemprop="description">This subject offers an interactive introduction to discrete mathematics oriented toward computer science and engineering. The subject coverage divides roughly into thirds: Fundamental concepts of mathematics: Definitions, proofs, sets, functions, relations. Discrete structures: graphs, state machines, modular arithmetic, counting. Discrete probability theory. On completion of 6.042J, students will be able to explain and apply the basic methods of discrete (noncontinuous) mathematics in computer science. They will be able to use these methods in subsequent courses in the design and analysis of algorithms, computability theory, software engineering, and computer systems.Interactive site components can be found on the Unit pages in the left-hand navigational bar, starting with Unit 1: Proofs.</span>Introduction to Theoretical Computer Science - Harvard CS Concentrationhttps://cs121.boazbarak.org/kirk862019-09-09T12:40:36+02:00computation course theory website <span itemprop="description">Introduction to Theoretical Computer Science - Harvard CS Concentration</span>Barak, Boazhttps://files.boazbarak.org/introtcs/lnotes_book.pdfkirk862019-09-03T15:06:42+02:00book computation mathematics theory <span itemprop="description">Barak, Boaz</span>