THE BOYER-MOORE THEOREM PROVER

THE BOYER-MOORE THEOREM PROVER
https://awards.acm.org/award-recipients/boyer_4797551
The Boyer-Moore Theorem Prover (NQTHM)
https://www.cs.utexas.edu/~moore/best-ideas/nqthm/index.html

Automation of Mathematical Induction as part of the History of Logic
https://www.cs.utexas.edu/~moore/publications/moore-wirth-2014a.pdf


# arXuv
## Towards Automated Verification of Logarithmic Arithmetic
Mark G. Arnold, Thomas A. Bailey, John R. Cowles
https://arxiv.org/pdf/2411.12923

### References
[1] M. Arnold, T. Bailey, J. Cowles and J. Cupal, Proceedings of the Interna- tional AMSE Conference Neural Networks San Diego, California, vol. 1, pp. 75–86, 29-31 May 1991.
[2] M. G. Arnold, T. A. Bailey, J. R. Cowles and M. D. Winkel, “Applying Features of IEEE 754 to Sign/Logarithm Arithmetic,” IEEE Transactions on Computers, vol. 41, pp. 1040–1050, August 1992.
[3] J. L. Barlow and E. H. Bareiss, “On Roundoff Error Distributions in Floating Point and Logarithmetic Arithmetic,” Computing, vol. 34, pp. 325-347, 1985.
[4] G. Barrett, “Formal methods applied to a floating-point number system,” IEEE Trans. Software Eng., vol. 15, pp. 611-621, May 1989.
[5] R. S. Boyer and J S. Moore. A Computational Logic Handbook, Academic Press, Boston, 1988.
[6] W.R. Bevier, “Kit and the short stack,” J. Automated Reasoning, vol. 5, pp. 519-430, 1989.
[7] B.S. Boyer and Yuan Yu, “Automated correctness proofs of machine code programs for a commercial microprocessor,” Tech. Report TH-91- 33, Comput. Sei. and Math. Dept., Univ. Texas Austin, 1991.
[8] R. P. Brent, “On the precision attainable with various floating point num- ber systems,” IEEE Trans. Comput., vol. C-22, pp. 601-606, June 1973.
[9] W. S. Brown, “A Simple but Realistic Model of Floating-Point Compu- tation,”ACM Transactions on Mathematical Software, vol. 7, no. 4, pp. 445-480, December 1981.
[10] “Fast Floating Point C Functions,” BYTE, vol. 16, no. 7, p. T2MW-8, July 1991.
19
[11] J. E. Holm, “Floating-Point Arithmetic and Correctness Proofs,” Ph.D. Thesis, Cornell Univ., 1980.
[12] W. A. Hunt, “Microprocessor design verification,” J. Automated Reasoning, vol. 5, pp. 429-460, 1989.
[13] M. Kaufmann, “A user’s manual for an interactive enhancement to the Boyer-Moore theorem prover,” Technical Report 19, Computational Logic Inc., Austin, Texas, 1988.
[14] N. G. Kingsbury and P. J. W. Rayner, “Digital Filtering Using Logarith- mic Arithmetic,” Electronics Letters, vol. 7, no. 2, pp. 56-58, 28 January 1971.
[15] T. Kurokawa and T. Mizukoshi, “Fast method of geometrical picture transformation using logarithmic number systems and its application for computer graphics,” Proceedings of the SPIE, Visual Communications and Image Processing ’90, vol. 1360, pt. 3, pp. 1479–1490, Lausanne, Switzer- land, October 1-4 1990.
[16] T. Kurokawa and T. Mizukoshi, “A Fast and Simple Method for Curve Drawing—A New Approach using Logarithmic Number Systems,” Journal of Information Processing, vol. 14, pp. 144-152, 1991.
[17] F. Lai and C. E. Wu, “A Hybrid Number System Processor with Ge- ometric and Complex Arithmetic Capabilities,” IEEE Transactions on Computers, vol. 40, pp. 952–962, August 1991.
[18] Language Compatible Arithmetic Standard, version 3.0, X3T2/91-006, ISOJIECITCL/SC22/WG11/N212, American National Standards Insti- tute, Dec. 26, 1990.
[19] D. M. Lewis, “A Hardware Engine for Analog Mode Simulation of MOS Digital Circuits,” 22nd Design Automation Conference, pp. 345-351, 1985.
[20] J. D. Marasa and D. W. Matula, “A Simulative Study of Correlated Error in Various Finite-Precision Arithmetics,” IEEE Transactions on Comput- ers, vol. C-22, pp. 587-597, June 1973.
[21] JS. Moore, Interval Analysis, Prentice Hall, 1966.
[22] JS. Moore, PITON: A Verified Assembly Language, Tech. Report 22,
Computational Logic, Inc. 1988.
[23] JS. Moore, “A mechanically verified language implementation,” J. of Automated Reasoning, vol, 5, pp, 461-492, 1989.
[24] R. E. Morley, T. J. Sullivan and G. L. Engel, “VLSI Based Design of a Battery-operated Hearing Aid,”Southcon/90, Orlando, Florida, pp. 55–59, 20-22 March 1990.
[25] H. Murveit, et al., “A large-vocabulary real-time continuous-speech recog- nition system,”Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP-89. pp. 789–792, Glas- gow, 1989.
[26] G. M. Papadourakis and H. Andre, “High Speed Implementation of Matrix Inversion Algorithms in Orthogonal Systolic Architectures,” Proceedings of the IEEE Southeastern Conference, IEEE catalog 88CH2571-8, pp. 200– 204, 1988.
[27] L. Pickett, “Soft Co-Processors,” Log Point Systems, Mountain View, CA, 1989.
[28] S. M. Rump, “Higher Order Computer Arithmetic,” Proc. 7th Symp. Comput. Arithmetic, pp. 302-308, 1985.
[29] T. Stouraitis, Logarithmic Number System Theory, Analysis, and Design, Ph.D. Dissertation, University of Florida, Gainesville, 1986.
[30] E. E. Swartzlander and A. G. Alexopoulos, “The Sign/Logarithm Number System,” IEEE Transactions on Computers, vol. C-24, pp. 1238–1242, December 1975.
[31] E. E. Swartzlander, et al., “Arithmetic for Ultra High Speed Tomography,” IEEE Transactions on Computers, vol. C-29, pp. 341-353, 1980.
[32] E. E. Swartzlander, D. Chandra, T. Nagle, and S. A. Starks, “Sign/logarithm Arithmetic for FFT Implementation,” IEEE Transac- tions on Computers, vol. C-32, pp. 526-534, 1983.
[33] P. J. Turner, “Implementation and analysis of extended SLI operations,” Proc. 10th Symp. Comput. Arithmetic, pp. 118-126, 1991.
[34] F. J. Taylor, R. Gill, J. Joseph and J. Radke, “A 20 Bit Logarithmic Number System Processor,” IEEE Transactions on Computers, vol. C-37, pp. 190–199, 1988.
[35] V. L. Volkov and P. V. Pakshin, “The Logarithmic Number System in Control Algorithms and Information Processing,” Soviet Journal of Com- puter and System Sciences, vol. 20, no. 1, pp. 132-138, 1992.
[36] M. Wilding, “A mechanically-checked correctness proof of a floating-point search program,” Technical Report 56, Computational Logic Inc., Austin, Texas, 1990.
[37] L. K. Yu, The Design and Implementation of a 30-bit Logarithmic Number System Processor, M.A.Sc. Thesis, University of Toronto, Canada, 1990.


## The Boyer-Moore Waterfall Model Revisited
Petros Papapanagiotou, Jacques Fleuriot
https://arxiv.org/pdf/1808.03810
### References
1. Aderhold, M.: Improvements in Formula Generalization. Proceedings of the 21st Conference on Automated Deduction (CADE-21), Lecture Notes in Computer Science (2007)
2. Alan Bundy David Basin, D.H., Ireland, A.: Rippling: Meta-Level Guidance for Mathematical Reasoning. Cambridge University Press (2005). URL http://dx.doi.org/10.1017/CBO9780511543326
3. Boulton, R.: Boyer-Moore Automation for the HOL System. Proceedings of the IFIP TC10/WG10. 2 Workshop on Higher Order Logic Theorem Proving and its Applications pp. 133–142 (1992)
4. Boyer, R., Moore, J.: A Computational Logic. ACM Monograph Series. Academic Press, New York (1979)
5. Boyer, R.S., Moore, J.S.: A computational logic handbook. Academic Press Professional, Inc., San Diego, CA, USA (1988)
6. Bundy, A.: A Science of Reasoning. Lecture Notes in Computer Science 1397, 10 (1989)
7. Bundy, A., van Harmelen, F., Horn, C., Smaill, A.: The Oyster-Clam system. Springer-Verlag New York, Inc. New York, NY, USA (1990)
8. Comon,H.:Inductionlessinduction.HandbookofAutomatedReasoning1,913–962(2001)
9. Dixon, L.: A Proof Planning Framework For Isabelle. Ph.D. thesis, University of Edinburgh. College of Science and Engineering. School of Informatics. (2006)
10. Harrison, J.: HOL done right. Unpublished draft (1996)
11. Harrison, J.: Optimizing Proof Search in Model Elimination. Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction pp. 313–327 (1996)
12.Hummel,B.:GenerierungvonInduktionsformelnundGeneralisierungbeimautomatischen beweisen mit vollsta ̈ndiger Induktion. Ph.D. thesis, FakultaI? t fuI? r Informatik der UniversitaI? t Karlsruhe. (1990)
13. Kapur, D.: Theorem proving support for hardware verification. Third Intl. Workshop on First-Order Theorem Proving (FTP 2000), St. Andrews, Scotland (2000)
14. Kaufmann, M., Moore, J., Manolios, P.: Computer-Aided Reasoning: An Approach. Kluwer Academic Pub (2000)
15. Paulson, L.: Isabelle.: Generic Theorem Prover. Springer (1994)
16. Siekmann, J., Benzmu ̈ller, C., Brezhnev, V., Cheikhrouhou, L., Fiedler, A., Franke, A., Horacek, H., Kohlhase, M., Meier, A., Melis, E., et al.: Proof development with ΩMEGA. Lecture notes in computer science pp. 144–149 (2002)
17. Walther, C., Schweitzer, S.: About VeriFun, Franz Baader, editor. Proc. Of the 19th Inter. Conf. on Automated Deduction (CADE-19) 2741, 322–327 (2002)


# Term
## HOL: Higher-Order Logic
Experiments with Choice in Dependently-Typed Higher-Order Logic
Daniel Ranalter1, Chad E. Brown2, and Cezary Kaliszyk1
https://arxiv.org/pdf/2410.08874
### References
[1] Julian Backes and Chad E. Brown. Analytic tableaux for higher-order logic with choice. Journal of Automated Reasoning, 47:451–479, 2011.
[2] Alexander Bentkamp, Jasmin Blanchette, Sophie Tourret, and Petar Vukmirović. Superposition for higher-order logic. Journal of Automated Reasoning, 67:10, 2023.
[3] Chad E. Brown. Satallax: An automatic higher-order prover. In Bernhard Gramlich, Dale Miller, and Uli Sattler, editors, Proc. 6th International Joint Conference on Automated Reasoning, volume 7364 of LNAI, pages 111–117, 2012.
[4] Chad E. Brown and Cezary Kaliszyk. Lash 1.0 (system description). In Jasmin Blanchette, Laura Kovács, and Dirk Pattinson, editors, Proc. 11th International Joint Conference on Automated Reasoning, volume 13385 of LNAI, pages 350–358, 2022.
[5] Alonzo Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5(2):56–68, 1940.
[6] John Harrison. HOL Light: An overview. In Stefan Berghofer, Tobias Nipkow, Christian Urban, and Makarius Wenzel, editors, Proc. 22nd International Conference on Theorem Proving in Higher Order Logics, volume 5674 of LNCS, pages 60–66, 2009.
[7] Johannes Niederhauser, Chad E. Brown, and Cezary Kaliszyk. Tableaux for automated rea- soning in dependently-typed higher-order logic. Submitted, http://cl-informatik.uibk.ac.at/cek/ submitted/jncbck.pdf.
[8] Tobias Nipkow, Lawrence C. Paulson, and Markus Wenzel. Isabelle/HOL — A Proof Assistant for Higher-Order Logic, volume 2283 of LNCS. Springer Berlin Heidelberg, 2002.
Choice in Dependently-Typed Higher-Order Logic Ranalter, Brown, Kaliszyk
[9] Colin Rothgang, Florian Rabe, and Christoph Benzmüller. Theorem proving in dependently-typed higher-order logic – extended preprint, 2023.
[10] John Rushby, Sam Owre, and Natarajan Shankar. Subtypes for specifications: Predicate subtyping in PVS. IEEE Transactions on Software Engineering, 24(9):709–720, 1998.
[11] Alexander Steen and Christoph Benzmüller. Extensional higher-order paramodulation in Leo-III. Journal of Automated Reasoning, 65:775–807, 2021.

<この項は書きかけです。順次追記します。>
This article is not completed. I will add some words and/or centences in order.
Este artículo no está completo. Agregaré algunas palabras en orden.
# Qiita Calendar 2024
祝休日・謹賀新年 2025年の目標
https://qiita.com/kaizen_nagoya/items/dfa34827932f99c59bbc

Qiita 1年間をまとめた「振り返りページ」＠2024
https://qiita.com/kaizen_nagoya/items/ed6be239119c99b15828

2024 参加・主催Calendarと投稿記事一覧 Qiita(248)
https://qiita.com/kaizen_nagoya/items/d80b8fbac2496df7827f

主催Calendar2024分析 Qiita(254)
https://qiita.com/kaizen_nagoya/items/15807336d583076f70bc

Calendar 統計
https://qiita.com/kaizen_nagoya/items/e315558dcea8ee3fe43e

LLM 関連 Calendar 2024 
https://qiita.com/kaizen_nagoya/items/c36033cf66862d5496fa

Large Language Model Related Calendar 
https://qiita.com/kaizen_nagoya/items/3beb0bc3fb71e3ae6d66

博士論文 Calendar 2024 を開催します。 
https://qiita.com/kaizen_nagoya/items/51601357efbcaf1057d0

博士論文(0)関連記事一覧
https://qiita.com/kaizen_nagoya/items/8f223a760e607b705e78

# 関連資料
' @kazuo_reve 私が効果を確認した「小川メソッド」
https://qiita.com/kazuo_reve/items/a3ea1d9171deeccc04da

' @kazuo_reve 新人の方によく展開している有益な情報
https://qiita.com/kazuo_reve/items/d1a3f0ee48e24bba38f1

' @kazuo_reve Vモデルについて勘違いしていたと思ったこと
https://qiita.com/kazuo_reve/items/46fddb094563bd9b2e1e


# 自己記事一覧
Qiitaで逆リンクを表示しなくなったような気がする。時々、スマフォで表示するとあらわっることがあり、完全に削除したのではなさそう。

４月以降、せっせとリンクリストを作り、統計を取って確率を説明しようとしている。
2025年２月末を目標にしている。

一覧の一覧( The directory of directories of mine.) Qiita(100)
https://qiita.com/kaizen_nagoya/items/7eb0e006543886138f39

仮説（0）一覧（目標100現在40）
https://qiita.com/kaizen_nagoya/items/f000506fe1837b3590df

Qiita(0)Qiita関連記事一覧（自分）
https://qiita.com/kaizen_nagoya/items/58db5fbf036b28e9dfa6

Error一覧 error(0)
https://qiita.com/kaizen_nagoya/items/48b6cbc8d68eae2c42b8

C++ Support(0)　
https://qiita.com/kaizen_nagoya/items/8720d26f762369a80514

Coding(0) Rules, C, Secure, MISRA and so on
https://qiita.com/kaizen_nagoya/items/400725644a8a0e90fbb0

Ethernet 記事一覧　Ethernet(0)
https://qiita.com/kaizen_nagoya/items/88d35e99f74aefc98794

Wireshark 一覧 wireshark(0)、Ethernet(48) 
https://qiita.com/kaizen_nagoya/items/fbed841f61875c4731d0

線網（Wi-Fi）空中線(antenna)(0) 記事一覧(118/300目標)
https://qiita.com/kaizen_nagoya/items/5e5464ac2b24bd4cd001

なぜdockerで機械学習するか 書籍・ソース一覧作成中 (目標100)
https://qiita.com/kaizen_nagoya/items/ddd12477544bf5ba85e2

プログラムちょい替え（0）一覧:4件
https://qiita.com/kaizen_nagoya/items/296d87ef4bfd516bc394

言語処理100本ノックをdockerで。python覚えるのに最適。:10+12
https://qiita.com/kaizen_nagoya/items/7e7eb7c543e0c18438c4

Python(0)記事をまとめたい。
https://qiita.com/kaizen_nagoya/items/088c57d70ab6904ebb53

安全（0）安全工学シンポジウムに向けて: 21
https://qiita.com/kaizen_nagoya/items/c5d78f3def8195cb2409

プログラマによる、プログラマのための、統計(0)と確率のプログラミングとその後
https://qiita.com/kaizen_nagoya/items/6e9897eb641268766909

転職(0)一覧
https://qiita.com/kaizen_nagoya/items/f77520d378d33451d6fe

技術士(0)一覧
https://qiita.com/kaizen_nagoya/items/ce4ccf4eb9c5600b89ea

Reserchmap(0) 一覧
https://qiita.com/kaizen_nagoya/items/506c79e562f406c4257e

物理記事　上位100
https://qiita.com/kaizen_nagoya/items/66e90fe31fbe3facc6ff

量子(0) 計算機, 量子力学 
https://qiita.com/kaizen_nagoya/items/1cd954cb0eed92879fd4

数学関連記事１００
https://qiita.com/kaizen_nagoya/items/d8dadb49a6397e854c6d

coq(0) 一覧
https://qiita.com/kaizen_nagoya/items/d22f9995cf2173bc3b13

統計(0)一覧
https://qiita.com/kaizen_nagoya/items/80d3b221807e53e88aba

図(0) state, sequence and timing. UML and お絵描き 
https://qiita.com/kaizen_nagoya/items/60440a882146aeee9e8f

色(0) 記事100書く切り口 
https://qiita.com/kaizen_nagoya/items/22331c0335ed34326b9b

品質一覧 
https://qiita.com/kaizen_nagoya/items/2b99b8e9db6d94b2e971

言語・文学記事　１００
https://qiita.com/kaizen_nagoya/items/42d58d5ef7fb53c407d6

医工連携関連記事一覧
https://qiita.com/kaizen_nagoya/items/6ab51c12ba51bc260a82

水の資料集(0)　方針と成果
https://qiita.com/kaizen_nagoya/items/f5dbb30087ea732b52aa

自動車　記事　１００
https://qiita.com/kaizen_nagoya/items/f7f0b9ab36569ad409c5

通信記事１００
https://qiita.com/kaizen_nagoya/items/1d67de5e1cd207b05ef7

日本語（０）一欄
https://qiita.com/kaizen_nagoya/items/7498dcfa3a9ba7fd1e68

英語(0) 一覧
https://qiita.com/kaizen_nagoya/items/680e3f5cbf9430486c7d

音楽　一覧(0) 
https://qiita.com/kaizen_nagoya/items/b6e5f42bbfe3bbe40f5d

「@kazuo_reve 新人の方によく展開している有益な情報」確認一覧 
https://qiita.com/kaizen_nagoya/items/b9380888d1e5a042646b

鉄道（０）鉄道のシステム考察はてっちゃんがてつだってくれる
https://qiita.com/kaizen_nagoya/items/faa4ea03d91d901a618a

OSEK OS設計の基礎　OSEK(100)
https://qiita.com/kaizen_nagoya/items/7528a22a14242d2d58a3

coding (101) 一覧を作成し始めた。omake:最近のQiitaで表示しない5つの事象
https://qiita.com/kaizen_nagoya/items/20667f09f19598aedb68

官公庁・学校・公的団体（NPOを含む）システムの課題、官（０）
https://qiita.com/kaizen_nagoya/items/04ee6eaf7ec13d3af4c3

「はじめての」シリーズ　 ベクタージャパン　
https://qiita.com/kaizen_nagoya/items/2e41634f6e21a3cf74eb

AUTOSAR(0)Qiita記事一覧, OSEK(75)
https://qiita.com/kaizen_nagoya/items/89c07961b59a8754c869

プログラマが知っていると良い「公序良俗」
https://qiita.com/kaizen_nagoya/items/9fe7c0dfac2fbd77a945

LaTeX(0) 一覧　
https://qiita.com/kaizen_nagoya/items/e3f7dafacab58c499792

自動制御、制御工学一覧（０）
https://qiita.com/kaizen_nagoya/items/7767a4e19a6ae1479e6b

Rust(0) 一覧　
https://qiita.com/kaizen_nagoya/items/5e8bb080ba6ca0281927

programの本質は計画だ。programは設計だ。
https://qiita.com/kaizen_nagoya/items/c8545a769c246a458c27

登壇直後版 色使い(JIS安全色) Qiita Engineer Festa 2023〜私しか得しないニッチな技術でLT〜 スライド編 0.15
https://qiita.com/kaizen_nagoya/items/f0d3070d839f4f735b2b

プログラマが知っていると良い「公序良俗」
https://qiita.com/kaizen_nagoya/items/9fe7c0dfac2fbd77a945

逆も真：社会人が最初に確かめるとよいこと。OSEK(69)、Ethernet(59)
https://qiita.com/kaizen_nagoya/items/39afe4a728a31b903ddc

統計の嘘。仮説（127）
https://qiita.com/kaizen_nagoya/items/63b48ecf258a3471c51b

自分の言葉だけで論理展開できるのが天才なら、文章の引用だけで論理展開できるのが秀才だ。仮説（136）
https://qiita.com/kaizen_nagoya/items/97cf07b9e24f860624dd

参考文献駆動執筆(references driven writing)・デンソークリエイト編
https://qiita.com/kaizen_nagoya/items/b27b3f58b8bf265a5cd1

「何を」よりも「誰を」。１０年後のために今見習いたい人たち
https://qiita.com/kaizen_nagoya/items/8045978b16eb49d572b2

Qiitaの記事に３段階または５段階で到達するための方法
https://qiita.com/kaizen_nagoya/items/6e9298296852325adc5e

出力(output)と呼ばないで。これは状態(state)です。
https://qiita.com/kaizen_nagoya/items/80b8b5913b2748867840

coding (101) 一覧を作成し始めた。omake:最近のQiitaで表示しない5つの事象
https://qiita.com/kaizen_nagoya/items/20667f09f19598aedb68

あなたは「勘違いまとめ」から、勘違いだと言っていることが勘違いだといくつ見つけられますか。人間の間違い(human error(125))の種類と対策
https://qiita.com/kaizen_nagoya/items/ae391b77fffb098b8fb4

プログラマの「プログラムが書ける」思い込みは強みだ。３つの理由。仮説（168）統計と確率(17) , OSEK(79)
https://qiita.com/kaizen_nagoya/items/bc5dd86e414de402ec29

出力(output)と呼ばないで。これは状態(state)です。
https://qiita.com/kaizen_nagoya/items/80b8b5913b2748867840

これからの情報伝達手段の在り方について考えてみよう。炎上と便乗。
https://qiita.com/kaizen_nagoya/items/71a09077ac195214f0db

ISO/IEC JTC1 SC7 Software and System Engineering
https://qiita.com/kaizen_nagoya/items/48b43f0f6976a078d907

アクセシビリティの知見を発信しよう！（再び）
https://qiita.com/kaizen_nagoya/items/03457eb9ee74105ee618

統計論及確率論輪講（再び）
https://qiita.com/kaizen_nagoya/items/590874ccfca988e85ea3

読者の心をグッと惹き寄せる7つの魔法
https://qiita.com/kaizen_nagoya/items/b1b5e89bd5c0a211d862

「@kazuo_reve 新人の方によく展開している有益な情報」確認一覧
https://qiita.com/kaizen_nagoya/items/b9380888d1e5a042646b

ソースコードで議論しよう。日本語で議論するの止めましょう（あるプログラミング技術の議論報告）
https://qiita.com/kaizen_nagoya/items/8b9811c80f3338c6c0b0

脳内コンパイラの3つの危険
https://qiita.com/kaizen_nagoya/items/7025cf2d7bd9f276e382

心理学の本を読むよりはコンパイラ書いた方がよくね。仮説（34）
https://qiita.com/kaizen_nagoya/items/fa715732cc148e48880e

NASAを超えるつもりがあれば読んでください。
https://qiita.com/kaizen_nagoya/items/e81669f9cb53109157f6

データサイエンティストの気づき!「勉強して仕事に役立てない人。大嫌い!!」『それ自分かも?』ってなった!!! 
https://qiita.com/kaizen_nagoya/items/d85830d58d8dd7f71d07

「ぼくの好きな先生」「人がやらないことをやれ」プログラマになるまで。仮説（37）　
https://qiita.com/kaizen_nagoya/items/53e4bded9fe5f724b3c4

なぜ経済学徒を辞め、計算機屋になったか（経済学部入学前・入学後・卒業後対応） 転職(1)  
https://qiita.com/kaizen_nagoya/items/06335a1d24c099733f64    

プログラミング言語教育のXYZ。 仮説（52） 
https://qiita.com/kaizen_nagoya/items/1950c5810fb5c0b07be4

【24卒向け】9ヶ月後に年収１０００万円を目指す。二つの関門と三つの道。
https://qiita.com/kaizen_nagoya/items/fb5bff147193f726ad25

「【25卒向け】Qiita Career Meetup for STUDENT」予習の勧め
https://qiita.com/kaizen_nagoya/items/00eadb8a6e738cb6336f

大学入試不合格でも筆記試験のない大学に入って卒業できる。卒業しなくても博士になれる。
https://qiita.com/kaizen_nagoya/items/74adec99f396d64b5fd5

全世界の不登校の子供たち「博士論文」を書こう。世界子供博士論文遠隔実践中心 安全(99)
https://qiita.com/kaizen_nagoya/items/912d69032c012bcc84f2

小川メソッド　覚え（書きかけ）
https://qiita.com/kaizen_nagoya/items/3593d72eca551742df68

DoCAP（ドゥーキャップ）って何ですか？
https://qiita.com/kaizen_nagoya/items/47e0e6509ab792c43327

views 20,000越え自己記事一覧
https://qiita.com/kaizen_nagoya/items/58e8bd6450957cdecd81

Views１万越え、もうすぐ１万記事一覧 最近いいねをいただいた213記事
https://qiita.com/kaizen_nagoya/items/d2b805717a92459ce853

amazon 殿堂入りNo1レビュアになるまで。仮説(102)
https://qiita.com/kaizen_nagoya/items/83259d18921ce75a91f4

100以上いいねをいただいた記事16選
https://qiita.com/kaizen_nagoya/items/f8d958d9084ffbd15d2a

小川清最終講義、最終講義（再）計画, Ethernet(100) 英語(100) 安全(100)
https://qiita.com/kaizen_nagoya/items/e2df642e3951e35e6a53

＜この記事は個人の過去の経験に基づく個人の感想です。現在所属する組織、業務とは関係がありません。＞
This article is an individual impression based on my individual experience. It has nothing to do with the organization or business to which I currently belong.
Este artículo es una impresión personal basada en mi experiencia personal. No tiene nada que ver con la organización o empresa a la que pertenezco actualmente.
### 文書履歴(document history)
ver. 0.01 初稿 　20250106
### 最後までおよみいただきありがとうございました。
いいね　💚、フォローをお願いします。
#### Thank you very much for reading to the last sentence.
Please press the like icon 💚　and follow me for your happy life.
### Muchas gracias por leer hasta la última oración.
Por favor, haz clic en el ícono Me gusta 💚 y sígueme para tener una vida feliz.