C++ Templates are Turing Complete Todd L. Veldhuizen tveldhui@acm.org Indiana University Computer Science Abstract We sketch a proof of a well-known folk theorem that C++ templates are Turing complete. The absence of a formal semantics for C++ template i

世の中カテゴリーの変更を依頼記事元:

ubiety.uwaterloo.ca/~tveldhui

2 usersがブックマークコメント

記事へのコメント2件

注目コメント
新着コメント

tasanobu C++　Template　テンプレート

2008/06/27 リンク

todesking C++ template、チューリング完全

2007/12/17 リンク

注目コメント算出アルゴリズムの一部にLINEヤフー株式会社の「建設的コメント順位付けモデルAPI」を使用しています

リンクを埋め込む

以下のコードをコピーしてサイトに埋め込むことができます

<iframe marginwidth="0" marginheight="0" src="https://b.hatena.ne.jp/entry.parts?url=http%3A%2F%2Fubiety.uwaterloo.ca%2F~tveldhui%2Fpapers%2F2003%2Fturing.pdf" scrolling="no" frameborder="0" height="230" width="500"><div class="hatena-bookmark-detail-info"><a href="http://ubiety.uwaterloo.ca/~tveldhui/papers/2003/turing.pdf">C++ Templates are Turing Complete Todd L. Veldhuizen tveldhui@acm.org Indiana University Computer Science Abstract We sketch a proof of a well-known folk theorem that C++ templates are Turing complete. The absence of a formal semantics for C++ template i</a><a href="https://b.hatena.ne.jp/entry/ubiety.uwaterloo.ca/~tveldhui/papers/2003/turing.pdf">はてなブックマーク - C++ Templates are Turing Complete Todd L. Veldhuizen tveldhui@acm.org Indiana University Computer Science Abstract We sketch a proof of a well-known folk theorem that C++ templates are Turing complete. The absence of a formal semantics for C++ template i</a></div></iframe>

プレビュー

規約違反を報告

いまの話題をアプリでチェック！

バナー広告なし
ミュート機能あり
ダークモード搭載

アプリをダウンロード

C++ Templates are Turing Complete Todd L. Veldhuizen tveldhui@acm.org Indiana University Computer Science Abstract We sketch a proof of a well-known folk theorem that C++ templates are Turing complete. The absence of a formal semantics for C++ template i

C++ Templates are Turing Complete Todd L. Veldhuizen tveldhui@acm.org Indiana University Computer... C++ Templates are Turing Complete Todd L. Veldhuizen tveldhui@acm.org Indiana University Computer Science Abstract We sketch a proof of a well-known folk theorem that C++ templates are Turing complete. The absence of a formal semantics for C++ template instantiation makes a rigorous proof unlikely. 1 Introduction It has been known for some time that C++ templates permit complicated computations t