Related Research Articles
The Association for Computing Machinery (ACM) is a US-based international learned society for computing. It was founded in 1947 and is the world's largest scientific and educational computing society. The ACM is a non-profit professional membership group, claiming nearly 110,000 student and professional members as of 2022. Its headquarters are in New York City.
The Gödel Prize is an annual prize for outstanding papers in the area of theoretical computer science, given jointly by the European Association for Theoretical Computer Science (EATCS) and the Association for Computing Machinery Special Interest Group on Algorithms and Computational Theory. The award is named in honor of Kurt Gödel. Gödel's connection to theoretical computer science is that he was the first to mention the "P versus NP" question, in a 1956 letter to John von Neumann in which Gödel asked whether a certain NP-complete problem could be solved in quadratic or linear time.
SIGCSE is the Association for Computing Machinery's (ACM) Special Interest Group (SIG) on Computer Science Education (CSE), which provides a forum for educators to discuss issues related to the development, implementation, and/or evaluation of computing programs, curricula, and courses, as well as syllabi, laboratories, and other elements of teaching and pedagogy. SIGCSE is also the name of one of the four annual conferences organized by SIGCSE.
Leslie Gabriel Valiant is a British American computer scientist and computational theorist. He is currently the T. Jefferson Coolidge Professor of Computer Science and Applied Mathematics at Harvard University. Valiant was awarded the Turing Award in 2010, having been described by the A.C.M. as a heroic figure in theoretical computer science and a role model for his courage and creativity in addressing some of the deepest unsolved problems in science; in particular for his "striking combination of depth and breadth".
ACC0, sometimes called ACC, is a class of computational models and problems defined in circuit complexity, a field of theoretical computer science. The class is defined by augmenting the class AC0 of constant-depth "alternating circuits" with the ability to count; the acronym ACC stands for "AC with counters". Specifically, a problem belongs to ACC0 if it can be solved by polynomial-size, constant-depth circuits of unbounded fan-in gates, including gates that count modulo a fixed integer. ACC0 corresponds to computation in any solvable monoid. The class is very well studied in theoretical computer science because of the algebraic connections and because it is one of the largest concrete computational models for which computational impossibility results, so-called circuit lower bounds, can be proved.
Language equations are mathematical statements that resemble numerical equations, but the variables assume values of formal languages rather than numbers. Instead of arithmetic operations in numerical equations, the variables are joined by language operations. Among the most common operations on two languages A and B are the set union A ∪ B, the set intersection A ∩ B, and the concatenation A⋅B. Finally, as an operation taking a single operand, the set A* denotes the Kleene star of the language A. Therefore language equations can be used to represent formal grammars, since the languages generated by the grammar must be the solution of a system of language equations.
Mark Joseph Guzdial is a Professor in the College of Engineering at the University of Michigan. He was formerly a professor in the School of Interactive Computing at the Georgia Institute of Technology affiliated with the College of Computing and the GVU Center. He has conducted research in the fields of computer science education and the learning sciences and internationally in the field of Information Technology. From 2001–2003, he was selected to be an ACM Distinguished Lecturer, and in 2007 he was appointed Vice-Chair of the ACM Education Board Council. He was the original developer of the CoWeb, one of the earliest wiki engines, which was implemented in Squeak and has been in use at institutions of higher education since 1998. He is the inventor of the Media Computation approach to learning introductory computing, which uses contextualized computing education to attract and retain students.
computational thinking (CT) is the mental skill to apply fundamental concepts and reasoning, derived from computing and computer science, to solve problems in all areas. In education, CT is a set of problem-solving methods that involve expressing problems and their solutions in ways that a computer could also execute. It involves automation of processes, but also using computing to explore, analyze, and understand processes.
Computer science education or computing education is the science and art of teaching and learning of computer science, computing and computational thinking. As a subdiscipline of pedagogy it also addresses the wider impact of computer science in society through its intersection with philosophy, psychology, linguistics, natural sciences, and mathematics. In comparison to science education and mathematics education, computer science (CS) education is a much younger field. In the history of computing, digital computers were only built from around the 1940s – although computation has been around for centuries since the invention of analog computers.
In computational complexity theory, the class QIP is the quantum computing analogue of the classical complexity class IP, which is the set of problems solvable by an interactive proof system with a polynomial-time verifier and one computationally unbounded prover. Informally, IP is the set of languages for which a computationally unbounded prover can convince a polynomial-time verifier to accept when the input is in the language and cannot convince the verifier to accept when the input is not in the language. In other words, the prover and verifier may interact for polynomially many rounds, and if the input is in the language the verifier should accept with probability greater than 2/3, and if the input is not in the language, the verifier should be reject with probability greater than 2/3. In IP, the verifier is like a BPP machine. In QIP, the communication between the prover and verifier is quantum, and the verifier can perform quantum computation. In this case the verifier is like a BQP machine.
John Harrison Watrous is a professor of computer science at the David R. Cheriton School of Computer Science at the University of Waterloo, a member of the Institute for Quantum Computing, an affiliate member of the Perimeter Institute for Theoretical Physics and a Fellow of the Canadian Institute for Advanced Research. He was a faculty member in the Department of Computer Science at the University of Calgary from 2002 to 2006 where he held a Canada Research Chair in quantum computing.
Joyce Currie Little is a computer scientist, engineer, and educator. She is a professor and former chairperson in the Department of Computer and Information Sciences at Towson University in Towson, Maryland.
Alexander Repenning is the Director of the Scalable Game Design project, a computer science professor adjunct, a founder of AgentSheets Inc., and a member of the Center for Lifelong Learning and Design at the University of Colorado in Boulder. Repenning is the inventor of drag and drop blocks programming. His research interests include computer science education, end-user programmable agents, human-computer interaction, and artificial intelligence.
Eric S. Roberts is an American computer scientist noted for his contributions to computer science education through textbook authorship and his leadership in computing curriculum development. He is a co-chair of the ACM Education Council, former co-chair of the ACM Education Board, and a former member of the SIGCSE Board. He led the Java task force in 1994. He was a Professor emeritus at Stanford University. He currently teaches at Willamette University in Salem, Oregon.
Tetsuo Asano is a Japanese computer scientist, the president of the Japan Advanced Institute of Science and Technology. His main research interest is in computational geometry.
David J. Malan is an American computer scientist and professor. Malan is a Gordon McKay Professor of Computer Science at Harvard University, and is best known for teaching course CS50, which is the largest open-learning course at Harvard University and Yale University and the largest Massive Open Online Course (MOOC) at EdX, with lectures being viewed by over a million people on the edX platform up to 2017.
Gloria Townsend is an American computer scientist and professor in the department of Computer Science at DePauw University in Indiana. She is known for her work in evolutionary computation and her involvement with women in computing. She has served on the Executive Committee of the Association for Computing Machinery (ACM) Council on Women in Computing. She is the author of One Hundred One Ideas for Small Regional Celebrations of Women in Computing. In 2013, she received the Mr. and Mrs. Fred C. Tucker Jr. Distinguished Career Award for notable contributions to DePauw through her commitments to students, teaching excellence, their chosen disciplines, and service to the University.
Valarie Barr is an American computer scientist with an endowed chair in the department of Computer Science at Mount Holyoke College in South Hadley, Massachusetts. She is known for her work with women in computing.
Susanne Edda Hambrusch is an Austrian-American computer scientist whose research topics include data indexing for range queries, and computational thinking in computer science education. She is a professor of computer science at Purdue University.
Alan Louis Selman was a mathematician and theoretical computer scientist known for his research on structural complexity theory, the study of computational complexity in terms of the relation between complexity classes rather than individual algorithmic problems.
References
- ↑ "Teaching App Creation, Unit 6 - Pedagogy Strand" (PDF). MIT App Inventor. 2018-03-11. Retrieved 2018-03-11.
- ↑ "Amber Settle". Jarvis College of Computing and Digital Media, DePaul University . Retrieved 2022-09-13.
- ↑ "The SIGCSE Board | Special Interest Group on Computer Science Education". sigcse.org. Retrieved 2018-03-11.
- ↑ "ACM Inroads: Archive". inroads.acm.org. Retrieved 2018-03-11.
- ↑ "Awards Recipient | ACM-W supporting, celebrating and advocating for Women in Computing". women.acm.org. Retrieved 2018-03-11.
- ↑ "Tenured and promoted faculty: College of Computing and Digital Media | Newsline | DePaul University". Newsline. Archived from the original on 2018-03-12. Retrieved 2018-03-11.
- ↑ Settle, Amber; Simon, Janos (2002-04-06). "Smaller solutions for the firing squad". Theoretical Computer Science. 276 (1–2): 83–109. doi:10.1016/S0304-3975(01)00191-8. ISSN 0304-3975.
- ↑ Mannila, Linda; Dagiene, Valentina; Demo, Barbara; Grgurina, Natasa; Mirolo, Claudio; Rolandsson, Lennart; Settle, Amber (2014-06-23). Computational Thinking in K-9 Education. ACM. pp. 1–29. doi:10.1145/2713609.2713610. ISBN 9781450334068. S2CID 207223092.
- ↑ McGill, Monica M.; Decker, Adrienne; Settle, Amber (2016-10-13). "Undergraduate Students' Perceptions of the Impact of Pre-College Computing Activities on Choices of Major". ACM Transactions on Computing Education. 16 (4): 15. doi:10.1145/2920214. S2CID 24214164.
