Frühere Suchanfragen

Keine früheren Suchanfragen

Suchoptionen

Nur verfügbar, wenn angemeldet.
mastodontech.de ist einer von vielen unabhängigen Mastodon-Servern, mit dem du dich im Fediverse beteiligen kannst.
Offen für alle (über 16) und bereitgestellt von Markus'Blog

Verwaltet von:

Serverstatistik:

1,5 Tsd.
aktive Profile

mastodontech.de: ÜberStatusProfilverzeichnisDatenschutzerklärung

Mastodon: ÜberApp herunterladenTastenkombinationenQuellcode anzeigenv4.4.0-rc.1

#theoreticalcomputerscience

0 Beiträge0 Beteiligte0 Beiträge heute
*
:flag_enby_wartime: 𝕛𝕦𝕝𝕖𝕤 :antifa:

I wonder whether "fusion trees with multiple roots" exist

what I know after a quick search

  • there is a bonsai technique concerning roots of fusion trees
  • there is a minecraft modpack called fusion forest
  • there is a company called b-forest
  • there is a famous counter strike player named forest
  • there is a subfield named forest informatics
  • there is a greek thing named b dag
#tcs#theoreticalComputerScience#cs
Oscar Cunningham

People say it's a misconception that quantum computers can evaluate a function on all its possible inputs in parallel. But actually a lot of quantum algorithms do begin by applying a function to a superposition of all possible inputs. It's just that after that point you need to do some difficult linear algebra and you can't always extract the information you want.

In fact, you can define a lot of important complexity classes in this way. The set of problems solvable in polynomial time with an oracle that evaluates a given circuit on all its possible inputs and tells you …

P: … nothing.
BPP: … a randomly chosen output.
PP: … a majority output.
NP: … if any of the outputs is nonzero.
co-NP: … if all of the outputs are nonzero.
PSPACE: … a fixed point.

#Math#Maths#Mathematics
*
Clément Canonne

This Karp Distinguished Lecture at at the Simons Institute by Rocco Servedio on July 10 on "New Directions in Property Testing" looks exciting! Rocco is a fantastic speaker.
simons.berkeley.edu/events/new

The Karp Lectures are public lectures, meant for a broad, general #TheoreticalComputerScience audience. Registration is free, in person or online.

To check your time zone: timeanddate.com/worldclock/con

Simons Institute for the Theory of ComputingNew Directions in Property Testing | Richard M. Karp Distinguished LectureProperty testing algorithms seek to determine whether an unknown massive object has some particular property of interest, or is "far" from having the property, while inspecting only a tiny portion of the object. Recent years have witnessed significant progress on both classic property testing problems and the development of several new property testing problems and frameworks, motivated by connections to machine learning theory and high-dimensional data analysis. In this talk, Rocco Servedio will survey several of these new property testing problems, models, and results. Rocco Servedio received his undergraduate degree in mathematics at Harvard and his PhD in computer science at Harvard, where his thesis was advised by Leslie Valiant. Servedio is a professor of computer science at Columbia University, where he has received a Presidential Teaching Award and served as department chair. His research interests within theoretical computer science include computational learning theory, property testing, computational complexity theory, lower bounds, pseudorandomness, and the study of randomness in computing. He has served as PC chair of conferences and workshops including STOC, CCC, COLT, and RANDOM, and has received best paper and best student paper awards from STOC, FOCS, COLT, ALT, and CCC.   The Richard M. Karp Distinguished Lectures were created in Fall 2019 to celebrate the role of Simons Institute Founding Director Dick Karp in establishing the field of theoretical computer science, formulating its central problems, and contributing stunning results in the areas of computational complexity and algorithms. Formerly known as the Simons Institute Open Lectures, the series features visionary leaders in the field of theoretical computer science and is geared toward a broad scientific audience. Light refreshments will be available at 3 p.m., prior to the start of the lecture.  The lecture recording URL will be emailed to registered participants. This URL can be used for immediate access to the livestream and recorded lecture. Lecture recordings will be publicly available on SimonsTV about 12 to 15 days following each presentation unless otherwise noted. The Simons Institute regularly captures photos and video of activity around the Institute for use in publications and promotional materials.  If you require special accommodation, please contact our access coordinator at simonsevents [at] berkeley.edu with as much advance notice as possible.
*
Clément Canonne

📢 Next week (Wed 12/13) on TCS+: at 10am PT/1pm ET, Aaron Bernstein from Rutgers University will speak on "Negative-Weight Single-Source Shortest Paths in Near-linear Time." Join us for the last TCS+ talk of 2023! #Algorithms #TheoreticalComputerScience

Details: tcsplus.wordpress.com/2023/12/

Register (optional): docs.google.com/forms/d/e/1FAI

TCS+ · TCS+ talk: Wednesday, December 13 — Aaron Bernstein, Rutgers UniversityThe next TCS+ talk (and the last of 2023!) will take place this coming Wednesday, December 13th at 1:00 PM Eastern Time (10:00 AM Pacific Time, 19:00 Central European Time, 18:00 UTC). Aaron Bernst…
Fortgeführter Thread
Lenore Blum

Manuel Blum and I study #consciousness from a #TheoreticalComputerScience (TCS) perspective.
TCS is a branch of #mathematics concerned with understanding the underlying principles of #computation and #complexity, including the implications and surprising consequences of resource limitations.
For a TCS perspective on #consciousness, see, bit.ly/38zAhf6
For a TCS perspective on #FreeWill, see, arxiv.org/pdf/2206.13942.pdf

AngesagtLive-Feeds
Über