Hu: If I can use some combination of blocking and non-blocking, to in conjunction with some parsing controller, that can bounce the interpreter line back up the script, then I can have a smart-script that executes functions on demand. The blocking mode does keep the script “running”, so the smart bounce up would have to be activated upon the action of the blocking.
Hu: The goal of this document is to investigate ways to 1) keep a script running for a longer period of time 2) run more iterations of specific lines or code blocks, such as, but not only, with built.in-loops, and also with pseudo-loopers, of our own design 3) be able to reverse the waterfall to flow upstream, at certain critical junctures 4) increase the overall “memory” of the script, in order to act as a pseudo-db, and increase its variable.handling-capacity<Turing><WP.MIC-H2S45> 5) trigger functionality upon user input, between HTTPs 6) make db.writes-reads, between HTTPs and 7) keep socket instances alive, for perpetuity<Turing><WP.MIC-H2S113>
Hu: I would pinpoint the tenets of this doc, specifically, to be the definition of done, of what must be improved, in the 1) HTTPS 2) interpreter linear waterfall layer, and 3) mid.to-long,term.variable-handling ie, components of the static | web, in order to facilitate the full realization of potential of socket-based real-time functionality. Presently, socket development is quite limited, not–necessarily due to limits in the php.socket-core<WP.MIC-H2S112>but rather, in these auxiliary statics<Turing>
CM H4S1: Socket-prog as a quantum computer:
H3S7: Quantum Hardware: <MIC.ch-15>: Stuttgart <a-r>: So what exactly goes into building a quantum computer? It all starts with atoms that are channeled into a stable | crystal lattice. After all, a quantum computer needs a processor before it can work. The Stuttgart researchers want to operate the computer at room temperature. To get the computer up and running in a vacuum chamber, the scientists must first channel nitrogen atoms into a diamond. These miniscule | invisible particles serve as a computer processor of sorts and are known as quantum bits or qubits.MIC: [D], the IBM Q System One quantum computer <b-2021, Möhlmann <a-r> A crystal lattice is a structural | merger <ch-8 H2S5> as both # ions and organic | atoms # <ch-9 H2S2 H3S1> and there is a half | similarity between the lattices formed between either, despite their much larger phenotypic | differences in molecular behavior in non-lattice bond structures. It makes sense thus that the design of q.tum-comps begin with such structures, as computer engineers are more accustomed to working with ions <ch-62 H2S7 H3S1> Kostka and Quin <a-r> Their work uses the impurities within diamonds – where a carbon atom is swapped out for a nitrogen atom ! within the crystal – to generate qubits, the standard bits within a quantum computer. MIC: the design of quantum computers necessarily requires collaboration between multiple academic fields <ch-13 H2S3 H3S2 H4S1> as well as # between academic science and industry <ch-62 H2S1 H3S1 H4S9, how science can be a startup>, as a significant proportion of the equity in the construction of large, industrial-scale supercomputers was conducted by billion dollar corporations; the reductionist | buildsafforded by the 7 figure budgets of science labs does not quite fit the mold for viable | quantum computers because they have a much larger startup cost due to the physical | difficulties of maintaining the molecular arrangements in a physical state to minimize error rate <Dr. Ketterle, MIT physics b-1957, 2001 Nobel Prize: Bose–Einstein condensation, predicted by Einstein in 1924-5 !?>
H3S1: Blocking vs non-blocking lit-rev:
H3S2: X.ref<fbno> loops lit-rev:
Blocking vs non-blocking:
Episode 16: International Master Kenneth Regan, interviewed by Chess for Life. The game in Ex #5 is discussed # at 42:13:
Pins! Chess for Beginners by WGM Jennifer Shahade, US Women’s Champion:
ME 591 Lecture 1: Quantum Tunneling at Purdue University: https://www.youtube.com/watch?v=8FEaW3lH4TU
Jobs, Steve. “Steve Jobs about Go to Market Strategy.” YouTube, YouTube, 18 Mar. 2015, https://www.youtube.com/watch?v=3BNGMMc3Bgc&ab_channel=VisionariesandLeaders.
Jobs, Steve. “Steve Jobs President & CEO, NeXT Computer Corp and Apple. MIT Sloan Distinguished Speaker Series.” MITVideoProductions, YouTube, 19 Dec. 2017, https://www.youtube.com/watch?v=Gk-9Fd2mEnI.
Goldowsky , Howard. “How to Catch a Chess Cheater: Ken Regan Finds Moves out of Mind.” US Chess Federation, 1 June 2014, http://www.uschess.org/index.php/June/How-To-Catch-A-Chess-Cheater-Ken-Regan-Finds-Moves-Out-Of-Mind.html.
Lipton, Richard J, and Kenneth W Regan. Quantum Algorithms via Linear Algebra: A Primer. MIT Press, 2014.
“Python for Loops.” W3schools, https://www.w3schools.com/python/python_for_loops.asp.
- This website was the recommended external resource at the University of Buffalo’s spring ‘21 CSE 115 intro weed out course taught by Dr. Matthew Hertz <Yakun = Grade A> The course was not curved and a straight up 900 / 1000 or higher was required.
Alexander Brudno <1963>. Bounds and valuations for shortening the search of estimates. Problemy Kibernetiki (10) 141–150 and Problems of Cybernetics (10) 225–241
James R. Slagle <1963>. Game Trees, M & N Minimaxing, and the M & N alpha-beta procedure. Artificial Intelligence Group Report 3, UCRL-4671, University of California
Alphonce, Carl. “Midterm Exam – SAMPLE.” CSE115 Computer Science I, University of Buffalo, 2018, https://cse.buffalo.edu/faculty/alphonce/FA18/CSE115/documents/FA18-CSE115-SampleExam-SOLUTION.pdf.
Roblox. “Loops.” DevHub, https://developer.roblox.com/en-us/articles/Loops.
- Roblox <b-2006 for Mac/Windows/Android/iOS,
- Fire-OS/Xbox-One> is a game for building games and contains a great developer portal that is kid friendly and pedagogical in the context of c-s fundamentals.
“Grover’s Algorithm.” IBM Quantum, https://quantum-computing.ibm.com/composer/docs/iqx/guide/grovers-algorithm.
Bradben. “Theory of Grover’s Search Algorithm – Azure Quantum.” Azure Quantum | Microsoft Docs, https://docs.microsoft.com/en-us/azure/quantum/concepts-grovers.
“Explore the Making of a Quantum Computer at the Institute of Physics at the University of Stuttgart.” Encyclopædia Britannica, Encyclopædia Britannica, Inc., https://www.britannica.com/video/179682/quantum-computers.
Holton, William Coffeen. “quantum computer”. Encyclopedia Britannica, 17 Aug. 2021, https://www.britannica.com/technology/quantum-computer. Accessed 27 June 2022.
“Know about the Future of Quantum Technology and How Quantum Devices Can Be Present in Everyday Technology.” Encyclopædia Britannica, Encyclopædia Britannica, Inc., https://www.britannica.com/video/186827/technology.
Möhlmann, Roman. “IBM and Fraunhofer <€2.8 billion bn annual budget – Wikipedia> <Joseph Ritter von, 1787 – 1826, optical lens manufacturer> Bring Quantum Computing to Germany.” Fraunhofer, 13 Mar. 2020, https://www.fraunhofer.de/en/press/research-news/2020/march/ibm-and-fraunhofer-bring-quantum-computin-to-germany.html.
Kostka , Johannes, and Michael Quin. “New Hub to Make Diamond-Based Quantum Computers.” RMIT University, https://www.rmit.edu.au/news/all-news/2022/apr/diamond-quantum-computing-hub.
Ketterle, Wolfgang. “21. Ion Trapping and Quantum Gates.” MIT OpenCourseWare 3.92M Subscribers, 11 July 2014, https://youtu.be/lJOuPmI–5c.
Monroe , Christopher. “Christopher Monroe – ‘Quantum Computing with Trapped Ions.’” Stanford Physics 7.13K Subscribers, YouTube, 21 May 2018, https://www.youtube.com/watch?v=9aOLwjUZLm0.
Fridovich-Keil, Judith L. and Rogers, Kara. “epigenetics“. Encyclopedia | Britannica, 3 Dec. 2018, https://www.britannica.com/science/epigenetics. Accessed 7 August 2022.
Jobs, Steve. “Steve Jobs’ 2005 Stanford Commencement Address (with Intro by President John Hennessy).” StanfordUniversity, YouTube, 14 May 2008, https://www.youtube.com/watch?v=Hd_ptbiPoXM
Mowshowitz, Deborah. “Teaching Scientific Concepts & Problem Solving.” How to Explain, 27 Aug. 2009, http://www.columbia.edu/cu/biology/Files/Mowshowitz/explaining.html.