paper-with-me

Papers

Brains and pseudorandom generators

2013-11-26 · Vašek Chvátal, Mark Goldsmith, Nan Yang

In a pioneering classic, Warren McCulloch and Walter Pitts proposed a model of the central nervous system; motivated by EEG recordings of normal brain activity, Chv\' atal and Goldsmith asked whether or not this model can be engineered to provide pseudorandom number generators. We supply evidence suggesting that the answer is negative.

📄 PDF Abstract BibTeX arXiv:1311.6531

Code (0)

등록된 구현이 없습니다.

Tasks

EEGElectroencephalogram (EEG)

Similar Papers 제목 키워드 기반

Statistical Quality and Reproducibility of Pseudorandom Number Generators in Machine Learning technologies

2025-07-02 · Benjamin A. Antunes arxiv

Machine learning (ML) frameworks rely heavily on pseudorandom number generators (PRNGs) for tasks such as data shuffling, weight initialization, dropout, and optimization. Yet, the statistical quality and reproducibility…

From Local Pseudorandom Generators to Hardness of Learning

2021-01-20 · Amit Daniely, Gal Vardi

We prove hardness-of-learning results under a well-studied assumption on the existence of local pseudorandom generators. As we show, this assumption allows us to surpass the current state of the art, and prove hardness o…

PAC learning

Quantum learning algorithms imply circuit lower bounds

2020-12-03 · Srinivasan Arunachalam, Alex B. Grilo, Tom Gur, Igor C. Oliveira 외

We establish the first general connection between the design of quantum algorithms and circuit lower bounds. Specifically, let $\mathfrak{C}$ be a class of polynomial-size concepts, and suppose that $\mathfrak{C}$ can be…

Learning Theory

Pseudorandom Error-Correcting Codes

2024-02-14 · Miranda Christ, Sam Gunn

We construct pseudorandom error-correcting codes (or simply pseudorandom codes), which are error-correcting codes with the property that any polynomial number of codewords are pseudorandom to any computationally-bounded …

A new neural-network-based model for measuring the strength of a pseudorandom binary sequence

2019-10-09 · Ahmed Alamer, Ben Soh

Maximum order complexity is an important tool for measuring the nonlinearity of a pseudorandom sequence. There is a lack of tools for predicting the strength of a pseudorandom binary sequence in an effective and efficien…