國立高雄大學圖資館 |

登入

回首頁

Python arithmeticthe informational nature of numbers /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Python arithmeticby Vincenzo Manca.
其他題名:	the informational nature of numbers /
作者:	Manca, Vincenzo.
出版者:	Cham :Springer Nature Switzerland :2024.
面頁冊數:	x, 104 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Python (Computer program language)
電子資源:	https://doi.org/10.1007/978-3-031-66545-5
ISBN:	9783031665455$q(electronic bk.)

Python arithmeticthe informational nature of numbers /
Manca, Vincenzo.

Python arithmeticthe informational nature of numbers /[electronic resource] :by Vincenzo Manca. - Cham :Springer Nature Switzerland :2024. - x, 104 p. :ill., digital ;24 cm. - Studies in big data,v. 1532197-6511 ;. - Studies in big data ;v.1..

The Origins of Digital Age -- Mathematical notation and Python -- Counting Algorithms in Python -- Arithmetic Operations -- Square Root Algorithms -- Primality, Equations, Congruences -- Symbolic Computation.

The book is a gentle introduction to Python using arithmetic, and vice versa, with a historical perspective encompassing programming languages within the wider process of development of mathematical notation. The revisitation of typical algorithms that are the core of elementary mathematical knowledge helps to grasp their essence and to clarify some assumptions that are often taken for granted but are very profound and of a very general nature. The first mathematician to define a systematic system for generating numbers was Archimedes of Syracuse in the third century B.C. The Archimedean system, which was defined in a book with the Latin title Arenarius, was not intended to define all numbers, but only very large numbers [13, 22, 23]. However, it can be considered the first system with the three main characteristics of a counting system that have the most important properties for complete arithmetic adequacy: creativity, infinity, and recursion. Creativity means that each numeral is new for numerals that precede it; infinity means that after any numeral there is always another numeral; recursion means that after an initial sequence of numerals coinciding with the digits of the system, digits repeat regularly in all subsequent numerals. Since the numerals are finite expressions of digits, their lengths increase along their generation. In the next chapter, Python is briefly introduced by linking this language to standard mathematical notation, which took its current form throughout a long process that extends from the introduction of decimal numerals to the eighteenth century, particularly within Euler's notational and conceptual framework. The third chapter is devoted to counting algorithms, showing that something that is usually taken for granted has intriguing aspects that deserve a very subtle analysis: the authors will show that the Python representation of counting algorithms is very informative and demonstrates the informational nature of numbers.

ISBN: 9783031665455$q(electronic bk.)

Standard No.: 10.1007/978-3-031-66545-5doiSubjects--Topical Terms:

215247
Python (Computer program language)

LC Class. No.: QA76.73.P98 / M36 2024

Dewey Class. No.: 005.133

Python arithmeticthe informational nature of numbers /
LDR:03254nmm a2200337 a 4500 001 672081
003 DE-He213
005 20241106115734.0
006 m d
007 cr nn 008maaau
008 250325s2024 sz s 0 eng d
020 $a 9783031665455$q(electronic bk.)
020 $a 9783031665448$q(paper)
024 7 $a 10.1007/978-3-031-66545-5 $2 doi
035 $a 978-3-031-66545-5
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.73.P98 $b M36 2024
072 7 $a UYQ $2 bicssc
072 7 $a COM004000 $2 bisacsh
072 7 $a UYQ $2 thema
082 0 4 $a 005.133 $2 23
090 $a QA76.73.P98 $b M268 2024
100 1 $a Manca, Vincenzo. $3 964729
245 1 0 $a Python arithmetic $h [electronic resource] : $b the informational nature of numbers / $c by Vincenzo Manca.
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2024.
300 $a x, 104 p. : $b ill., digital ; $c 24 cm.
490 1 $a Studies in big data, $x 2197-6511 ; $v v. 153
505 0 $a The Origins of Digital Age -- Mathematical notation and Python -- Counting Algorithms in Python -- Arithmetic Operations -- Square Root Algorithms -- Primality, Equations, Congruences -- Symbolic Computation.
520 $a The book is a gentle introduction to Python using arithmetic, and vice versa, with a historical perspective encompassing programming languages within the wider process of development of mathematical notation. The revisitation of typical algorithms that are the core of elementary mathematical knowledge helps to grasp their essence and to clarify some assumptions that are often taken for granted but are very profound and of a very general nature. The first mathematician to define a systematic system for generating numbers was Archimedes of Syracuse in the third century B.C. The Archimedean system, which was defined in a book with the Latin title Arenarius, was not intended to define all numbers, but only very large numbers [13, 22, 23]. However, it can be considered the first system with the three main characteristics of a counting system that have the most important properties for complete arithmetic adequacy: creativity, infinity, and recursion. Creativity means that each numeral is new for numerals that precede it; infinity means that after any numeral there is always another numeral; recursion means that after an initial sequence of numerals coinciding with the digits of the system, digits repeat regularly in all subsequent numerals. Since the numerals are finite expressions of digits, their lengths increase along their generation. In the next chapter, Python is briefly introduced by linking this language to standard mathematical notation, which took its current form throughout a long process that extends from the introduction of decimal numerals to the eighteenth century, particularly within Euler's notational and conceptual framework. The third chapter is devoted to counting algorithms, showing that something that is usually taken for granted has intriguing aspects that deserve a very subtle analysis: the authors will show that the Python representation of counting algorithms is very informative and demonstrates the informational nature of numbers.
650 0 $a Python (Computer program language) $3 215247
650 0 $a Programming languages (Electronic computers) $x Mathematics. $3 985314
650 0 $a Computer science $x Mathematics. $3 181991
650 1 4 $a Computational Intelligence. $3 338479
650 2 4 $a Python. $3 763308
650 2 4 $a Data Engineering. $3 839346
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Studies in big data ; $v v.1. $3 675357
856 4 0 $u https://doi.org/10.1007/978-3-031-66545-5
950 $a Intelligent Technologies and Robotics (SpringerNature-42732)