4 citations · 22 across the 26 of their papers we have counts for
5 papers · 1 filter
Hilbert's Tenth Problem: Refinements and Variants
William Gasarch
Hilbert's 10th problem, stated in modern terms, is: Find an algorithm that will, given determine if there exists $a_1, a_2, \ldots, a_n \in \math…
Distinct Volume Subsets via Indiscernibles
William Gasarch, Douglas Ulrich
Erdös proved that for every infinite there is with , such that all pairs of points from have distinct distances, and he gave…
Which Unbounded Protocol for Envy Free Cake Cutting is Better?
William Gasarch
A division of a cake by n people is envy free if everyone thinks they got the biggest pieces. Note that peoples tastes can differ. There is a discrete protocol for envy free divisi…
Low, Superlow, and Superduperlow Sets: An Exposition of a Known But Not Well-Known Result
William Gasarch
A set is low if A' \le_T HALT. A set is superlow if A' \le_tt HALT. A set is superduperlow if A' \le_btt HALT. While it was known that any superduperlow is decidable it does not se…
Reverse Mathematics and Recursive Graph Theory
William Gasarch, Jeffry Hirst
We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theore…