我偶然发现了一篇论文,其字体和格式非常赏心悦目。我尝试了许多不同的字体,但找不到完全匹配的字体。我也喜欢它的间距和线宽。如果您能帮我识别这些内容,我将不胜感激!
完整论文请点击这里https://arxiv.org/abs/2401.14953
答案1
我已经复制了你想要的输出的 80%。我已经使用了XCharter-数学以及书法字体 Asana Math。
\documentclass[12pt]{article}
\usepackage{fontspec}
\usepackage{unicode-math}
\setmainfont{XCharter}
\setmathfont{XCharter-Math.otf}
\setmathfont[range={cal,bfcal},
Alternate,
Scale=MatchUppercase]
{Asana Math}
\begin{document}
\textbf{Semimeasures.} A semimeasure is a probability measure $P$ over infinite and finite sequences $\mathcal{X}^{\infty}\cup \mathcal{X}^*$ for some finite alphabet $X$ assumed to be $\{0,1\}$ (most statements hold for arbitrary finite $\mathcal{X}$). Let $\mu(x)$ be the probability that an (in)finite sequence starts with $x.$ While proper distributions satisfy $\sum_{a\in \mathcal{X}}\mu(xa)=\mu(x)$, semimeasures exhibit probability gaps and satisfy $\sum_{\alpha\in \mathcal{X}}\mu(xa)\leq\mu(x).$
\textbf{Turing Machines}. A Turing Machine (TM) takes a string of symbols $z$ as an input, and outputs a string of symbols $x$ (after reading $z$ and halting), i.e. $T(z)=x.$ For convenience we define the output string at computation step s as $T^s(z)=x$ which may be the empty string $\epsilon$ We adopt similar notation for Universal Turing Machines $U$. Monotone TMs (see Definition 1 below) are special TMs that can incrementally build the output string while incrementally reading the input program, which is a convenient practical property we exploit in our experiments.
\end{document}
答案2
Tt 的 arxiv,因此您可以下载完整的 tex 源并使用完全相同的字体和样式,只需使用您在问题中输入的链接并单击TeX 源右侧边栏中的链接。